Inorder and Preorder Traversal to Binary tree<br/>The first element in the Preorder traversal is the root. Find the  index of this number in the Inorder traversal. The elements to the left side of this index in the Inorder traversal form the left subtree and elements to the right form the right sub tree. Recursively repeat the procedure till there is no possibility of constructing another sub tree.<br/>Inorder and Postorder Traversal to Binary tree<br/>The last element in the Postorder traversal is the root. Find the  index of this number in the Inorder traversal. The elements to the left side of this index in the Inorder traversal form the left subtree and elements to the right form the right sub tree. Recursively repeat the procedure till there is no possibility of constructing another sub tree.<br/>