Create Tree Using PostOrder and InOrder : APPROACH

#1

I know that for Post Order , the sequence is like " LRN " and for In Order it’s " LNR ".
But how to start with the question ?
I have created a node and gave recursive calls for the left branch and the right branch inside a loop.

#2

so just find the last value of post order(“LRN”) which is ‘N’ in in-order.
then the in-order will be divided into the two parts:
Left subtree befor ‘N’ node
Right subtree after ‘N’ node