GATE CS 2005 — Question 36

Multiple choice 2 marks Question 36 2005

Question 36

MCQ 2 marks · −0.66 Programming and Data Structures

Postorder traversal of a given binary search tree T produces the following sequence of keys:

10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29

Which one of the following sequences of keys can be the result of an in-order traversal of the tree T?

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2005 Programming and Data Structures

Source: GATE 2005 Computer Science and Engineering, Q36 (question number approximate)

All Programming and Data Structures questions