Given Inorder and Preorder traversals of a binary tree, print Postorder traversal.
Example:
Input:
Inorder traversal in[] = {4, 2, 5, 1, 3, 6}
Preorder traversal pre[] = {1, 2, 4, 5, 3, 6}
Output:
Postorder traversal is {4, 5, 2, 6, 3, 1}
Print Postorder traversal from given Inorder and Preorder traversals: https://www.geeksforgeeks.org/print-postorder-from-given-inorder-and-preorder-traversals/