<br/>When we transverse the postorder array, each element is searched in the inorder for that node. <br/>Since all the elements to the left must to inserted in the left child of the tree and all the elements to the right must be added to the right child of the tree.