Register

GATE CSE 1998 | Question: 20

4,699 views
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}$
User Avatar

1 Answer

Best answer
25 votes
25 votes

The binary tree will be

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

21 votes
21 votes
1 answer
1
Kathleen asked Sep 26, 2014
4,194 views
GATE CSE 1998 | Question: 21
Derive a recurrence relation for the size of the smallest AVL tree with height $h$. What is the size of the smallest AVL tree with height $8$?
Derive a recurrence relation for the size of the smallest AVL tree with height $h$.What is the size of the smallest AVL tree with height $8$?
User Avatar
26 votes
26 votes
5 answers
2
Kathleen asked Sep 26, 2014
7,840 views
GATE CSE 1998 | Question: 19a
Let $p$ be a pointer as shown in the figure in a single linked list. What do the following assignment statements achieve? q:= p -> next p -> next:= q -> next q -> next:=(q -> next) -> next (p -> next) -> next:= q
Let $p$ be a pointer as shown in the figure in a single linked list. What do the following assignment state...
User Avatar
29 votes
29 votes
11 answers
4
Kathleen asked Sep 25, 2014
14,669 views
GATE CSE 1998 | Question: 2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is g...
User Avatar
Link Copied!