Binary Tree construction

Question

Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong)

Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.

Comments

Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB

such tree can't be constructed. 

---

So it means that given preorder/postorder and inorder, there is no guarantee that one can come up with a tree. But if one does come up with a tree, then it is guaranteed be unique, am I right?

Answer 1

unique tree can be generated

(preorder and inorder)=    yes

(postorder and inorder)=  yes

( preorder and postorder )=  no

 (inorder= cab and preorder=abc) => such tree dosnt exist.

Comments

then why not in this case? here also inorder is given as well as a preorder ! But we cant find an unique tree !!

---

i this ques preorder and inorder given are not correct for any tree. and if they are correctly given we can create a unique tree.

---

It might help you