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.
Recent questions tagged treetraversal
+1
vote
0
answers
1
DS POST ORDER
WHAT IS THE POST ORDER IF ROOT NODE IS P?
asked
Jan 6
in
DS
by
iarnav
Veteran
(
20k
points)

46
views
treetraversal
datastructure
postorder
+2
votes
3
answers
2
tree traversals , how to approach?
asked
Nov 13, 2017
in
DS
by
Parshu gate
Boss
(
6.4k
points)

68
views
binarytree
datastructure
treetraversal
+2
votes
3
answers
3
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
Boss
(
6.4k
points)

87
views
binarytree
datastructure
treetraversal
0
votes
1
answer
4
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
(
919
points)

137
views
datastructure
algorithms
bst
binarytree
treetraversal
binarysearchtree
0
votes
0
answers
5
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
Veteran
(
16.7k
points)

51
views
algorithms
treetraversal
+3
votes
5
answers
6
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 8, 2017
in
DS
by
sh!va
Veteran
(
36.2k
points)

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

304
views
datastructure
treetraversal
tree
preorder
postorder
0
votes
0
answers
8
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 4, 2017
in
Programming
by
sushmita
Veteran
(
14.6k
points)

43
views
graphtheory
datastructure
treetraversal
+2
votes
1
answer
9
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 31, 2016
in
Algorithms
by
yg92
Loyal
(
3.5k
points)

770
views
algorithms
dfs
treetraversal
graphalgorithms
+1
vote
0
answers
10
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 28, 2016
in
DS
by
Sankaranarayanan P.N
Veteran
(
12.1k
points)

47
views
binarysearchtree
treetraversal
+3
votes
1
answer
11
How to find the structure of Tree with given Pre Order and Post Order
asked
Oct 21, 2016
in
DS
by
pC
Veteran
(
24.4k
points)

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

168
views
ugcnetdec2015ii
datastructure
treetraversal
+2
votes
2
answers
13
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
(
108k
points)

255
views
ugcnetjune2015ii
datastructure
treetraversal
+2
votes
1
answer
14
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 ... 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
(
108k
points)

395
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
isro sc 2017 2nd paper
Which college to expect?
Interview Guidance
CDAC CoursesAugust session
Counselling...
Follow @csegate
Gatecse
Recent questions tagged treetraversal
Recent Blog Comments
@raviyogi Do you know what was the cutoff ot IIT ...
I think the exam has not yet been created.
Then why it's not appearing as a separate exam in ...
very low chances for top nits even in nsr round
okay. What about top NITs?
33,701
questions
40,250
answers
114,331
comments
38,858
users