Skip to content
Related Articles

Related Articles

Improve Article

G-Fact 8

  • Difficulty Level : Easy
  • Last Updated : 06 Jul, 2018

To uniquely construct a Binary Tree, Inorder together with either Postorder or Preorder must be given (See this for details). However, either Postorder or Preorder traversal is sufficient to uniquely construct a Binary Search Tree. To construct Binary Search tree, we can get Inorder traversal by sorting the given Preorder or Postorder traversal. So we have the required two traversals and can construct the Binary Search Tree.

My Personal Notes arrow_drop_up
Recommended Articles
Page :