Computer Sciences > Gate 2017 Set-1 > Binary Search Tree
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.
Note: The height of a tree with a single node is 0.
Correct : Binary Search Tree
Similar Questions
In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b] ? Assume that the number of re...
In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b] ? Assume that the number of re...
In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b] ? Assume that the number of re...
Total Unique Visitors
Loading......