GATE1998-20

+14 votes

721 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 (52.1k points) | 721 views

Please log in or register to add a comment.

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 (5.7k points)
edited Dec 24, 2017 by Puja Mishra

Please log in or register to add a comment.

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

← Prev. Next →

Related questions

+15 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 (52.1k points) | 1.2k views

gate1998
data-structure
trees
descriptive
numerical-answers

+16 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 Veteran (52.1k points) | 1.6k 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 (52.1k points) | 2.9k views

gate1998
data-structure
arrays
easy

+22 votes

7 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 Veteran (52.1k points) | 2.7k views

gate1998
data-structure
trees
normal

+22 votes

6 answers

GATE1998-1.24
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves. The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$

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

gate1998
data-structure
trees
normal

+2 votes

2 answers

GATE1998-10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.

asked Aug 12, 2018 in Set Theory & Algebra by Arjun Veteran (420k points) | 275 views

gate1998
descriptive
set-theory&algebra
relations

+16 votes

3 answers

GATE1998-6a
Solve the following recurrence relation $x_n = 2x_{n-1}-1, n>1$ $x_1=2$

asked May 4, 2016 in Algorithms by Arjun Veteran (420k points) | 1.3k views

gate1998
algorithms
recurrence
descriptive

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

I have done the payment but when I check payment...
Awesome!
Yes sir the pdf is not yet given , lease provide...
Is Go book still available in Rs 1600 .I want to...
Nice reference !!👍

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Recent Posts

Recent Blog Comments