Data Structures - Trees
GATE CSE & IT · 2 questions across 2 years (2017-2025) · 5% recurrence rate
Recurrence sparkline
2017–2025201720212025
Difficulty mix
med 100%
Question types
MCQ2
All 2 questions on Data Structures - Trees
2025 Q13
Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?
Med✓
2017 Q36
The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is:
Med✓