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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
+13
votes
452
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
(
59.5k
points)

452
views
Facebook
Google+
Twitter
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
+17
votes
Best answer
The binary tree will be
answered
May 30, 2015
by
Anu
Loyal
(
5.9k
points)
edited
Dec 24, 2017
by
Puja Mishra
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+13
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
(
59.5k
points)

908
views
gate1998
datastructure
trees
descriptive
numericalanswers
+2
votes
2
answers
2
GATE19887iii
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
(
99.8k
points)

143
views
gate1988
normal
descriptive
datastructure
binarytree
+2
votes
1
answer
3
ISI2014CS2a
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
(
99.8k
points)

129
views
descriptive
isi2014
datastructure
binarytree
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
Anxiety
Nielit 2018
Donation (Kerala Flood)
Schedule for GATE 2019
GATE 2019 official website
All categories
General Aptitude
1.3k
Engineering Mathematics
5.5k
Digital Logic
2.1k
Programming & DS
4k
Programming
2.9k
DS
1k
Algorithms
3.4k
Theory of Computation
4.3k
Compiler Design
1.6k
Operating System
3.1k
Databases
3.1k
CO & Architecture
2.7k
Computer Networks
3.1k
Non GATE
1.1k
Others
1.4k
Admissions
501
Exam Queries
451
Tier 1 Placement Questions
20
Job Queries
62
Projects
12
Follow @csegate
Gatecse
Recent Blog Comments
Thanx man ... i really appreciate it ...
Hey bro, Firstly if you can't solve a ...
I am not able to update my credentials on the ...
Sir I have ordered GO PDF on 16 Aug 2018 still ...
gate overflow books are awesome; every one should ...
38,174
questions
45,676
answers
132,609
comments
49,563
users