Given two arrays that represent Preorder traversals of a full binary tree and its mirror tree, we need to write a program to construct the binary tree using these two Preorder traversals.

A **Full Binary Tree** is a binary tree where every node has either 0 or 2 children.

**Note**: It is not possible to construct a general binary tree using these two traversals. But we can create a full binary tree using the above traversals without any ambiguity.

Examples:

Input : preOrder[] = {1,2,4,5,3,6,7} preOrderMirror[] = {1,3,7,6,2,5,4} Output : 1 / \ 2 3 / \ / \ 4 5 6 7

**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.