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.
- Given a binary tree, print out all of its root-to-leaf paths one per line.
- Construct Tree from given Inorder and Preorder traversals
- Construct Full Binary Tree from given preorder and postorder traversals
- Convert a Binary Tree into its Mirror Tree
- Construct a tree from Inorder and Level order traversals | Set 1
- nth Rational number in Calkin-Wilf sequence
- Sum of nodes at maximum depth of a Binary Tree | Iterative Approach
- Flatten a binary tree into linked list
- Check if two nodes are cousins in a Binary Tree | Set-2
- Check if two trees are mirror of each other using level order traversal