Problem
Finding postorder using Inorder & Pre-order
Easy
0/10
Problem statement
The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is:
One or more answers may be correct
One or more answers may be correct