Computer Sciences > GATE 2026 SET-1 > Binary Search Tree
Let P be the set of all integers from 1 to 15. Consider any order of insertion of the elements of P into a binary search tree that creates a complete binary tree.
Which one of the following elements can NEVER be the third element that is inserted?
Which one of the following elements can NEVER be the third element that is inserted?
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......