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

Programming and data structure miscellaneous

Programming & Data Structure

  1. The pre-order traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the post-order traversal sequence of the same tree ?
    1. 10, 20, 15, 23, 25, 35, 42, 39, 30
    2. 15, 10, 25, 23, 20, 42, 35, 39, 30
    3. 15, 20, 10, 23, 25, 42, 35, 39, 30
    4. 15, 10, 23, 25, 20, 35, 42, 39, 30
Correct Option: D

NA



Your comments will be displayed only after manual approval.