Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Data Structures | Tree Traversals | Question 5

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

Which of the following pairs of traversals is not sufficient to build a binary tree from the given traversals?
(A) Preorder and Inorder
(B) Preorder and Postorder
(C) Inorder and Postorder
(D) None of the Above


Answer: (B)

Explanation: See https://www.geeksforgeeks.org/if-you-are-given-two-traversal-sequences-can-you-construct-the-binary-tree/ for details.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!