The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
GATE199820
+14
votes
706
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
datastructure
binarytree
descriptive
asked
Sep 26, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

706
views
answer
comment
You do not have permission to perform this operation
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.6k
points)
edited
Dec 24, 2017
by
Puja Mishra
comment
You do not have permission to perform this operation
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+14
votes
1
answer
1
GATE199821
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
datastructure
trees
descriptive
numericalanswers
+15
votes
5
answers
2
GATE199819a
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
datastructure
linkedlists
normal
+21
votes
3
answers
3
GATE19982.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 rowmajor 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.8k
views
gate1998
datastructure
arrays
easy
+21
votes
7
answers
4
GATE19982.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(n1) +1$ $xn1$ $xn +1$ $x(n+1)$
asked
Sep 26, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

2.6k
views
gate1998
datastructure
trees
normal
+21
votes
6
answers
5
GATE19981.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.8k
views
gate1998
datastructure
trees
normal
+2
votes
2
answers
6
GATE199810b
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
(
416k
points)

253
views
gate1998
descriptive
settheory&algebra
relations
+16
votes
3
answers
7
GATE19986a
Solve the following recurrence relation $x_n = 2x_{n1}1, n>1$ $x_1=2$
asked
May 4, 2016
in
Algorithms
by
Arjun
Veteran
(
416k
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 Posts
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
All categories
General Aptitude
1.8k
Engineering Mathematics
7.3k
Digital Logic
2.9k
Programming and DS
4.9k
Programming
3.5k
DS
1.3k
Algorithms
4.3k
Theory of Computation
6.1k
Compiler Design
2.1k
Operating System
4.2k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.4k
Others
1.6k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
Recent Blog Comments
Why no pay now option is showing , i wanted to...
Nah I just meant, maybe consignment no. was...
49,807
questions
54,729
answers
189,317
comments
79,910
users