Computer Sciences > GATE 2026 SET-1 > Binary Search Tree
The following sequence corresponds to the preorder traversal of a binary search tree T:
50, 25, 13, 10, 30, 60, 55, 70, 65, 80, 75, 90
The position of the element 60 in the postorder traversal of T is ______. (answer in integer)
Note: The position begins with 1.
50, 25, 13, 10, 30, 60, 55, 70, 65, 80, 75, 90
The position of the element 60 in the postorder traversal of T is ______. (answer in integer)
Note: The position begins with 1.
Correct : 11
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......