Concept drill
balanced BST
GATE CSE & IT · Complexity Theory · 2004-2014
3
PYQs
67%
keyed
1
elite explanations
3
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2014 PYQ
Suppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up all the numbers in T that lie between L and H. Suppose there...
medium
2012 PYQ
The worst case running time to search for an element in a balanced binary search tree with n2 n elements is
easyanswer keyelite explanation
2004 PYQ
A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function g(x) for each node x. If the cost of computing g(x) is min{ no. of lea...
mediumanswer key