1k views
Draw the binary tree with node labels $\text{a, b, c, d, e, f and g}$ for which the inorder and postorder traversals result in the following sequences:

Inorder: $\text{a f b c d g e}$

Postorder: $\text{a f c g e d b}$
in DS | 1k views

The binary tree will be

by
edited