Understanding construction using postorder and inorder traversal

Just like with preorder and inorder construction, we can construct a binary tree if both its postorder and inorder traversal sequence are given. We use both sequences in tandem to construct the tree and resolve any ambiguity incrementally.

Constructing a binary tree from a given postorder and inorder traversal is very similar to constructing a binary tree from preorder and inorder traversal.