GATEverse Practice, past papers & mock tests
GATE 2005
Programming & Data StructuresTreeseasyMCQ2 marks
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?
Save your progress

Related Programming & Data Structures PYQs