Binary Tree using Inorder and Postorder

We identify a node from the postorder array, locate it in the inorder traversal which splits the array into the left and right subtree.