20 votes 20 votes 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}$ DS gate1998 data-structures binary-tree descriptive + – Kathleen asked Sep 26, 2014 Kathleen 4.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 25 votes 25 votes The binary tree will be Anu answered May 30, 2015 • edited May 9, 2021 by gatecse Anu comment Share Follow See all 0 reply Please log in or register to add a comment.