The following sequence corresponds to the preorder traversal of a binary search tree:
50, 25, 13, 40, 30, 47, 75, 60, 70, 80, 77
The position of the element 60 in the postorder traversal of is ________. (answer in integer)
Note: The position begins with 1.
GATE CS 2026 (Forenoon) — Question 62
Data StructuresBSTs & Binary HeapsNAT2 marksMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on BSTs & Binary Heaps
- GATE CS 2026 (Forenoon) · Q23Let n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P whose index starts from 1. Which of…
- GATE CS 2026 (Forenoon) · Q40Let 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…

