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
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
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
Recent questions tagged treetraversal
0
votes
0
answers
1
GATEBOOK2019 Mock Test154
If Tree1 and Tree2 are the trees given below, which traversals of Tree1 and Tree2, respectively, will produce the same sequence of node names? preorder & postorder postorder & inorder postorder & postorder inorder & inorder
asked
Jan 19
in
DS
by
GATEBOOK
Boss
(
11.4k
points)

66
views
gb2019mock1
treetraversal
0
votes
0
answers
2
PREORDER, POSTORDER INORDER
Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong….
asked
Jan 8
in
Algorithms
by
Vikas123
(
333
points)

88
views
treetraversal
datastructure
0
votes
0
answers
3
Made Easy Booklet
Suppose a binary tree has only three nodes A, B and C and you are given that the postorder traversal for the tree is BAC. The exact preorder traversal for the tree is. CAB ABC CBA A definite preorder traversal cannot be determined from the information given
asked
Nov 6, 2018
in
DS
by
shgarg
(
21
points)

155
views
datastructure
binarytree
madeeasybooklet
treetraversal
+2
votes
2
answers
4
self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.
asked
Jul 16, 2018
in
DS
by
Vegeta
Junior
(
823
points)

155
views
binarytree
binarysearchtree
treetraversal
0
votes
2
answers
5
Binary search tree preorder
someone please explain this question A binary search tree contains the values 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output? how the option D is correct? A 53124786 B 53126487 C 53241678 D 53124768
asked
Jul 5, 2018
in
Study Resources
by
amber12
(
41
points)

195
views
binarysearchtree
treetraversal
bst
+1
vote
1
answer
6
Tree , Preorder , depthfirst order , breadthfirst order
Preorder is same as : a) depthfirst order b) breadthfirst search c) topological order d) linear order
asked
Jul 4, 2018
in
DS
by
arya_stark
Active
(
1.6k
points)

186
views
datastructure
treetraversal
+1
vote
0
answers
7
DS POST ORDER
WHAT IS THE POST ORDER IF ROOT NODE IS P?
asked
Jan 6, 2018
in
DS
by
iarnav
Loyal
(
7.9k
points)

74
views
treetraversal
datastructure
postorder
+7
votes
1
answer
8
Number of Binary tree
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?
asked
Dec 19, 2017
in
Programming
by
junaid ahmad
Loyal
(
8.4k
points)

388
views
treetraversal
binarytree
0
votes
1
answer
9
MadeEasy Test Series: Programming & DS  Trees
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder traversal.?? how to find it ?
asked
Dec 7, 2017
in
Programming
by
aaru14
(
475
points)

157
views
madeeasytestseries
datastructure
trees
treetraversal
+2
votes
3
answers
10
tree traversals , how to approach?
Let T be a rooted binary tree whose vertices are labelled with symbols a, b, c, d, e, f, g, h, i, j, k. Suppose the inorder and postorder traversals of T produce the following sequences. inorder: a, b, c, d, e, f, g, h, i, j, k postorder: a, c, b, e, f, h, j, k, i, g, d How many leaves does the tree have?
asked
Nov 13, 2017
in
DS
by
Parshu gate
Active
(
3.1k
points)

191
views
binarytree
datastructure
treetraversal
+2
votes
3
answers
11
Tree traversals
For a binary tree T, preorder traversal yields: 11,8,6,4,7,10,19,43,31,29,37,49 and inorder traversal yields: 4,6,7,8,10,11,19,29,31,37,43,49 The height of the T is ________________.
asked
Nov 13, 2017
in
DS
by
Parshu gate
Active
(
3.1k
points)

330
views
binarytree
datastructure
treetraversal
0
votes
1
answer
12
Binary Tree construction
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong) Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.
asked
Nov 8, 2017
in
DS
by
humblefool
Junior
(
927
points)

423
views
datastructure
algorithms
bst
binarytree
treetraversal
binarysearchtree
0
votes
0
answers
13
Algorithm
1. What is the time complexity to design BST from given postorder and inorder traversal? 2. What is the time complexity to design BST from given postorder only. I know time to design BST from Preorder is O(n).
asked
Oct 24, 2017
in
Algorithms
by
Anu007
Boss
(
18.4k
points)

149
views
algorithms
treetraversal
+5
votes
5
answers
14
ISRO201750
If the post order traversal gives ab cd * + then the label of the nodes 1,2,3.. will be + , , *, a,b,c,d a, ,b,+,c,*,d a,b,c,d,,*,+ ,a,b,+,*,c,d
asked
May 7, 2017
in
DS
by
sh!va
Boss
(
31.9k
points)

2.9k
views
isro2017
datastructure
binarytree
treetraversal
0
votes
1
answer
15
How to find preorder predecessor,preorder successor, postorder predecessor and postorder successor
asked
Apr 14, 2017
in
Algorithms
by
Snigdha Mandal
(
9
points)

608
views
datastructure
treetraversal
trees
0
votes
2
answers
16
Data Structure InOrder Predecessor
If a node in a BST has two children, then its inorder predecessor has a) No left child b) No right child c) 2 children d) no child
asked
Feb 8, 2017
in
DS
by
smartmeet
Active
(
4.8k
points)

2.1k
views
datastructure
tree
treetraversal
0
votes
0
answers
17
GRAPH TRAVERSALS
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??
asked
Feb 3, 2017
in
Programming
by
sushmita
Boss
(
16.4k
points)

84
views
graphtheory
datastructure
treetraversal
+2
votes
1
answer
18
DFS using Stack
Could someone please explain Depth first Search using Stack? I have found different algorithms for handling the visited flag and the way the nodes are pushed. I am having problems in solving these types of questions  Find the nodes or number of nodes that are pushed onto stack more than once? Could someone please help with a small example?
asked
Dec 30, 2016
in
Algorithms
by
yg92
Active
(
3.1k
points)

1.5k
views
algorithms
dfs
treetraversal
graphalgorithms
+1
vote
0
answers
19
Kerala PSC AP Exam
A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in preorder and the values of in each node printed out the sequence of values obtained is 5,3,1,2,4,6,8,7. If the tree is traversed in post order, the sequence obtained would be A) 8 7 6 5 4 3 2 1 B) 1 2 3 4 8 7 6 5 C) 2 1 4 3 6 7 8 5 D) 2 1 4 3 7 8 6 5
asked
Oct 27, 2016
in
DS
by
Sankaranarayanan P.N
Boss
(
11.1k
points)

72
views
binarysearchtree
treetraversal
+3
votes
1
answer
20
How to find the structure of Tree with given Pre Order and Post Order
how can we find unique structure of a tree with given pre order and post order traversal . Please explain in detail with an example ( please give an example with number of nodes > 5 for more understanding ) References ... admission Test there had a question from this Topic . Could some one help ? Is it Really not possible ?
asked
Oct 21, 2016
in
DS
by
pC
Boss
(
21.2k
points)

706
views
datastructure
treetraversal
+1
vote
1
answer
21
UGCNETDec2015II38
The inorder traversal of the following tree is $2 \, \, \, 3 \, \, \, 4 \, \, \, 6 \, \, \, 7 \, \, \, 13 \, \, \, 15 \, \, \, 17 \, \, \, 18 \, \, \, 18 \, \, \, 20$ ...
asked
Aug 2, 2016
in
DS
by
Sankaranarayanan P.N
Boss
(
11.1k
points)

526
views
ugcnetdec2015ii
datastructure
treetraversal
+2
votes
2
answers
22
UGCNETJune2015II23
Level order Traversal of a rooted Tree can be done by starting from root and performing: Breadth First Search Depth First Search Root Search Deep Search
asked
Jul 30, 2016
in
Programming
by
jothee
Veteran
(
97.1k
points)

556
views
ugcnetjune2015ii
datastructure
treetraversal
+2
votes
1
answer
23
UGCNETJune2015II4
Consider the following statements: Depthfirst search is used to traverse a rooted tree Preorder, Postorder and Inorder are used to list the vertices of an ordered rooted tree. Huffman's algorithm is used to find an optimal binary tree with given weights Topological sorting provides a ... Which one of the above statements is true? a and b c and d a, b, and c a, b, c, and d
asked
Jul 30, 2016
in
Algorithms
by
jothee
Veteran
(
97.1k
points)

814
views
ugcnetjune2015ii
trees
treetraversal
To see more, click for the
full list of questions
or
popular tags
.
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
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
My journey from Wipro to an IISc student  GATE 2019
Interview Experience at IITPalakkad
Follow @csegate
Recent questions tagged treetraversal
Recent Blog Comments
Hi, the previous email was sent to only those who...
@kriti05 can you please tell me when did you got...
It was said that there will be an address...
sir .I recvd a mail which states "Your...
49,808
questions
54,489
answers
188,267
comments
74,658
users