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
While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is
What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
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......