Computer Sciences > GATE 2021 SET-1 > Binary Search Tree
A binary search tree T contains n distinct elements.
What is the time complexity of picking an element in T that is smaller than the maximum element in T?
What is the time complexity of picking an element in T that is smaller than the maximum element in T?
Correct : d
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?
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.
Total Unique Visitors
Loading......