Check if two nodes are in same subtree of the root node

Maximum parent children sum in Binary tree

Print cousins of a given node in Binary Tree | Single Traversal

Convert an arbitrary Binary Tree to a tree that holds Children Sum Property - Set 2

Sum of all the Boundary Nodes of a Binary Tree

Total sum except adjacent of a given node in a Binary Tree

Nodes at Kth level without duplicates in a Binary Tree

Find n-th node in Preorder traversal of a Binary Tree

Count all k-sum paths in a Binary Tree

Minimum value to be added at each level in Binary Tree to make all level sum equal

Kth ancestor of a node in binary tree | Set 2

Find n-th node of inorder traversal

Kth Maximum Level sum

K-th ancestor of a node in Binary Tree | Set 3

Introduction to Height Balanced Binary Tree

Find the largest Perfect Subtree in a given Binary Tree

Inorder Successor of a node in Binary Tree

Check if a Binary tree is Subtree of another Binary tree | Set 3

Find the distance between given node and Last level

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

Last Updated : 15 Jun, 2022

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

Mirror

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.

Suggest improvement

Find the distance between given node and Last level

Write an Efficient C Program to Reverse Bits of a Number

Share your thoughts in the comments

Similar Reads

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

Construct Special Binary Tree from given Inorder traversal

Check if two given key sequences construct same BSTs

Construct a Perfect Binary Tree from Preorder Traversal

Construct a Maximum Binary Tree from two given Binary Trees

Level order traversal of Binary Tree using Morris Traversal

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

Construct a Complete N-ary Tree from given Postorder Traversal

Construct a special tree from given preorder traversal

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

GeeksforGeeks

Article Tags :

Practice Tags :

Tree