GATEverse Practice, past papers & mock tests
GATE 2008
Programming & Data StructuresTreesmediumMCQ2 marks
You are given the postorder traversal, P, of a binary search tree on the n elements 1, 2, ..., n. You have to determine the unique binary search tree that has P as its postorder traversal. What is the time complexity of the most efficient algorithm for doing this?
Save your progress

Related Programming & Data Structures PYQs