GATE1998-20

+13 votes

561 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-structure
binary-tree
descriptive

asked Sep 26, 2014 in DS by Kathleen Veteran (59.9k points) | 561 views

Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof here

Please log in or register to answer this question.

1 Answer

+18 votes

Best answer

The binary tree will be

answered May 30, 2015 by Anu Loyal (6k points)
edited Dec 24, 2017 by Puja Mishra

Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof here

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

← Prev. Next →

Related questions

+13 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 Veteran (59.9k points) | 1.1k views

gate1998
data-structure
trees
descriptive
numerical-answers

+3 votes

2 answers

GATE1988-7iii
Consider the tree given in the below figure, insert $13$ and show the new balance factors that would arise if the tree is not rebalanced. Finally, carry out the required rebalancing of the tree and show the new tree with the balance factors on each mode.

asked Dec 19, 2016 in DS by jothee Veteran (115k points) | 272 views

gate1988
normal
descriptive
data-structure
binary-tree

+2 votes

1 answer

ISI2014-CS-2a
Let $B$ be a rooted binary tree of $n$ nodes. Two nodes of $B$ are said to be a sibling pair if they are the children of the same parent. For example, given the binary tree in Figure 1, the sibling pairs are (2, 3) and (6, 7). Design an $O(n)$ time algorithm that prints all the sibling pairs of $B$.

asked May 31, 2016 in DS by jothee Veteran (115k points) | 133 views

descriptive
isi2014
data-structure
binary-tree

+14 votes

2 answers

GATE2002-6
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.

asked Sep 16, 2014 in DS by Kathleen Veteran (59.9k points) | 523 views

gate2002
data-structure
binary-tree
easy
descriptive

+2 votes

0 answers

ISI2013-CS-2a
Draw a complete binary tree $T$ with $(N − 1)$ nodes where $N = 2^n$. Suppose each node in $T$ is a processor and each edge of $T$ is a physical link between two processors through which they can communicate. Given $M$ ... given architecture to compute the sum of each array $SUM_i = \Sigma^N_{j=1} e_{ji}$ for all $i$ in $O(\log N + M)$ time.

asked Jun 1, 2016 in Algorithms by jothee Veteran (115k points) | 73 views

descriptive
isi2013
algorithms
data-structure
binary-tree

+14 votes

4 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 Veteran (59.9k points) | 1.3k views

gate1998
data-structure
linked-lists
normal

+21 votes

3 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 Veteran (59.9k points) | 2.5k views

gate1998
data-structure
arrays
easy

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

Recent Blog Comments

Well it is quite nostalgic for me as if I have...
See in recent posts "For GATE CSE Admissions 2019"
which ppt are you referring to, can you share the...
I am not a ranker so you might not believe on my...
What is the status on appsgate website? I...

Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof here

Please log in or register to answer this question.

1 Answer

Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof here

Related questions

Recent Posts

Recent Blog Comments