Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Data Structures | Binary Search Trees | Question 8

  • Difficulty Level : Hard
  • Last Updated : 28 Jun, 2021

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?
(A) 10, 20, 15, 23, 25, 35, 42, 39, 30
(B) 15, 10, 25, 23, 20, 42, 35, 39, 30
(C) 15, 20, 10, 23, 25, 42, 35, 39, 30
(D) 15, 10, 23, 25, 20, 35, 42, 39, 30


Answer: (D)

Explanation: The following is the constructed tree

            30
         /      \
        20       39 
       /  \     /  \
     10    25  35  42  
      \   /
      15 23


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!