GATE CSE 2026 Session 1 Q62: Postorder position of 60 in a BST given by its preorder
- Programming and Data Structures
- 2 marks
- NAT
- No negative marking
Question
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.
Try it: numerical answer: type the value
Show answer and explanation
Answer: 7 (official GATE 2026 final answer key)
Concept used: A BST is determined by its preorder: the root comes first, then smaller keys, then larger keys.
First step: Rebuild the tree: 50 has left subtree {25, 13, 40, 30, 47} and right subtree {75, 60, 70, 80, 77}; then list the postorder.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2026 Session 1 CS question paper and final answer key, organised by IIT Guwahati. Question paper · Answer key
More Programming and Data Structures PYQs
- 2026 Session 1 · Q23Non-leaf indices in a 1-indexed binary heap with n odd
- 2026 Session 1 · Q24Empty slots after linear-probing inserts with h(x) = (x+7) mod 11
- 2026 Session 1 · Q33Maximum height of a full binary tree with 23 nodes
- 2026 Session 1 · Q34Output of a C function with a shadowed block variable
- 2026 Session 1 · Q39Recursive length of a non-empty singly linked list
- 2026 Session 1 · Q40Third insertion that can never yield a complete BST of 1..15