Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

Programming and data structure miscellaneous

Programming & Data Structure

  1. 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 ?
    1. 9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95
    2. 9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29
    3. 29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95
    4. 95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29
Correct Option: A

Inorder traversal of a BST always gives elements in increasing order. Among all four options, (a) is the only increasing order sequence.



Your comments will be displayed only after manual approval.