Build tree from inorder and postorder

#1

segmentation fault occur

#2

Refer this and cross check your approach https://www.geeksforgeeks.org/construct-a-binary-tree-from-postorder-and-inorder/

#3

can u plzz check my code why segmentation fault occur

#4

why are u not replying and clearing my doubt ???
i have paid for this and requesting you to clear my doubt and you just share a link of some geeksforgeeks stuff i supposed i haven’t paid for geeksforgeeks stuff

#5

@ajayrajsingh_817 Sorry for the late response. Due to a lot of pending doubt i was not able to check your code.
Change line 27 in your code to
for(int j=s;j<=e;j++)
Seg fault was because of that.

#6

thank you it gives correct output