Binary Tree From Inorder And Postorder.
Input :
Inorder : [2, 1, 3]
Postorder : [2, 3, 1]
Return :
1
/ \
2 3
Link to the Online Judge: Binary Tree From Inorder And Postorder | InterviewBit
I am able to do this using recursive approach, but not sure how to proceed iteratively.Can you provide the approach?
- List item