Build a tree from inorder and postorder

#1

sir here I dont understand why the base case is:
if(s>e)
return nullptr;

#2

Hello @mzk1994
the code which have you seen there we are dividing the array into two halves so that if any value which with which has devided the array the values to its left side will always comes in the left subtree and the right values will always come in the right subtree.
and this we have to do till our starts is less then end.
if any point start becomes greater then end we have to attach null their and stop.
if you have any doubt you can ask here:
Happy Learning!!

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.