If you are given two traversal sequences, can you construct the binary tree?

It depends on what traversals are given. If one of the traversal methods is Inorder then the tree can be constructed, otherwise not.

Therefore, following combination can uniquely identify a tree.

Inorder and Preorder.
Inorder and Postorder.
Inorder and Level-order.

And following do not.

Postorder and Preorder.
Preorder and Level-order.
Postorder and Level-order.

For example, Preorder, Level-order and Postorder traversals are same for the trees given in above diagram.

Preorder Traversal = AB
Postorder Traversal = BA
Level-Order Traversal = AB

So, even if three of them (Pre, Post and Level) are given, the tree can not be constructed.

Article Tags :

DSA

Tree

Recommended Articles

1. Construct Full Binary Tree using its Preorder traversal and Preorder traversal of its mirror tree

2. Construct Special Binary Tree from given Inorder traversal

3. Check if two given key sequences construct same BSTs

4. Construct a Perfect Binary Tree from Preorder Traversal

5. Construct a Maximum Binary Tree from two given Binary Trees

6. Level order traversal of Binary Tree using Morris Traversal

7. Pre Order, Post Order and In Order traversal of a Binary Tree in one traversal | (Using recursion)

8. Construct a Complete N-ary Tree from given Postorder Traversal

9. Construct a special tree from given preorder traversal

10. Check if a binary tree is subtree of another binary tree using preorder traversal : Iterative

11. Check if a given array can represent Preorder Traversal of Binary Search Tree

12. Check if the given array can represent Level Order Traversal of Binary Search Tree

13. Construct XOR tree by Given leaf nodes of Perfect Binary Tree

14. Given level order traversal of a Binary Tree, check if the Tree is a Min-Heap

15. Construct the Rooted tree by using start and finish time of its DFS traversal

16. Construct the full k-ary tree from its preorder traversal

17. Count sequences of given length having non-negative prefix sums that can be generated by given values

18. Find parent of given node in a Binary Tree with given postorder traversal

19. Construct BST from given preorder traversal using Stack

20. Construct a BST from given postorder traversal using Stack

21. Construct BST from given preorder traversal using Sorting

22. Construct BST from its given level order traversal | Set-2

23. Construct BST from given preorder traversal | Set 1

24. Construct BST from its given level order traversal

25. Complexity of different operations in Binary tree, Binary Search Tree and AVL tree