GATE1998-20

+15 votes

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}$

gate1998
data-structures
binary-tree
descriptive

asked Sep 26, 2014 in DS by Kathleen | 1k views

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

+20 votes

Best answer

The binary tree will be

answered May 30, 2015 by Anu
edited Dec 24, 2017 by Puja Mishra

Please log in or register to add a comment.

← Prev. Next →

← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

+17 votes

1 answer

GATE1998-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$?

asked Sep 26, 2014 in DS by Kathleen | 1.6k views

gate1998
data-structures
trees
descriptive
numerical-answers

+17 votes

5 answers

GATE1998-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

asked Sep 26, 2014 in DS by Kathleen | 2.2k views

gate1998
data-structures
linked-lists
normal

+24 votes

6 answers

GATE1998-2.14
Let $A$ be a two dimensional array declared as follows: A: array [1 …. 10] [1 ….. 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location $100$, what is the address of the element $A[i][j]$? $15i+j+84$ $15j+i+84$ $10i+j+89$ $10j+i+89$

asked Sep 26, 2014 in DS by Kathleen | 4k views

gate1998
data-structures
arrays
easy

+23 votes

8 answers

GATE1998-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)$

asked Sep 26, 2014 in DS by Kathleen | 3.8k views

gate1998
data-structures
trees
normal

Quick search syntax

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true