Postorder traversal of a given binary search tree is:
10, 3, 2, 5, 6, 4, 8, 11, 9, 15, 20, 19, 12, 7
The inorder traversal of the tree would be:
Is not unique
7, 4, 2, 3, 6, 5,10, 12, 9, 8, 11, 19, 15, 20
20, 10, 2, 3, 5, 8, 9, 12 , 11 ,15 ,4, 6, 7, 19
2, 3, 4, 5, 6, 7, 8 , 9, 10, 11, 12, 15, 19, 20
Because in a binary search tree , the left tree has alll keys smaller than root and root has all keys greater than it. So, since Inorder is Left Root Right, the root will always be greater than left and smaller than right, annd this structure is recursively followed by each nodes, so we obtain a sorted array
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.