Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged tree-traversal
1
vote
1
answer
1
NIELIT Scientist B 2020 November: 45
The Preorder traversal of a tree given below is: $\text{A B D F E C G I H J K L}$ $\text{A B C D E G H F I J K L}$ $\text{A B E D F C G H I J K L}$ $\text{A B D F E C G I J H K L}$
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
272
views
nielit-scb-2020
tree-traversal
1
vote
1
answer
2
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 5
A binary search tree contains the values-$1,2,3,4,5,6,7$ and $8.$ The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output? $5\;\;3\;\;1\;\;2\;\;4\;\;7\;\;8\;\;6\;\;$ ... $5\;\;3\;\;2\;\;4\;\;1\;\;6\;\;7\;\;8$ $5\;\;3\;\;1\;\;2\;\;4\;\;7\;\;6\;\;8$
Lakshman Patel RJIT
asked
in
DS
Apr 1, 2020
by
Lakshman Patel RJIT
482
views
nielit2017oct-assistanta-cs
data-structures
binary-search-tree
tree-traversal
1
vote
2
answers
3
NIELIT 2017 DEC Scientific Assistant A - Section B: 2
In binary search tree which traversal is used for getting ascending order values ? Inorder Preorder Postorder None of the options
Lakshman Patel RJIT
asked
in
DS
Mar 31, 2020
by
Lakshman Patel RJIT
588
views
nielit2017dec-assistanta
data-structures
binary-search-tree
tree-traversal
1
vote
1
answer
4
NIELIT 2016 MAR Scientist B - Section C: 18
Traversing a binary tree first root and then left and right subtrees called ______ traversal. postorder. preorder. inorder. none of these.
Lakshman Patel RJIT
asked
in
DS
Mar 31, 2020
by
Lakshman Patel RJIT
1.0k
views
nielit2016mar-scientistb
data-structures
binary-tree
tree-traversal
0
votes
3
answers
5
NIELIT 2017 DEC Scientist B - Section B: 30
If for a given Binary Search Tree (BST) the pre-order traversal is $41,23,11,31,62,50,73$. Then which of the following is its post-order traversal? $11,31,23,50,73,62,41$ $31,11,23,50,41,62,73$ $11,31,50,23,73,62,41$ $11,31,23,50,62,73,41$
Lakshman Patel RJIT
asked
in
DS
Mar 30, 2020
by
Lakshman Patel RJIT
1.1k
views
nielit2017dec-scientistb
data-structures
binary-search-tree
tree-traversal
2
votes
2
answers
6
ME Test series Question on AVL Tree
Shankar Kakde
asked
in
DS
Jan 19, 2019
by
Shankar Kakde
413
views
avl-tree
tree-traversal
made-easy-test-series
0
votes
1
answer
7
Please solve this Q
kallu singh
asked
in
DS
Jan 17, 2019
by
kallu singh
254
views
data-structures
tree-traversal
0
votes
1
answer
8
ME TEST SERIES
Shankar Kakde
asked
in
DS
Jan 10, 2019
by
Shankar Kakde
136
views
binary-tree
tree-traversal
made-easy-test-series
0
votes
0
answers
9
PRE-ORDER, POST-ORDER IN-ORDER
Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong….
Vikas123
asked
in
Algorithms
Jan 8, 2019
by
Vikas123
486
views
tree-traversal
data-structures
0
votes
1
answer
10
UPPCL AE 2018:69
The preorder traversal sequence of a binary search tree is $25, 15, 10, 4, 12, 22, 18, 24, 50, 35, 31, 44, 70, 66, 90$ Which one of the following is the postorder traversal sequence of the same tree? $4, 12, 10, 18, 24, 22, 15, 31, 44, 35, 66, 90, 70, 50, 25$ ... $4, 12, 10, 18, 24, 15, 22, 31, 44, 50, 66, 90, 70, 35, 25$
Lakshman Patel RJIT
asked
in
DS
Jan 5, 2019
by
Lakshman Patel RJIT
168
views
uppcl2018
data-structures
binary-search-tree
tree-traversal
0
votes
3
answers
11
NIELIT 2018-80
_____ traversals are not sufficient to build a binary tree. Preorder and Inorder Postorder and Inorder Postorder and Preorder None of these
Arjun
asked
in
DS
Dec 7, 2018
by
Arjun
11.0k
views
nielit-2018
data-structures
tree-traversal
0
votes
0
answers
12
Made Easy Booklet
Suppose a binary tree has only three nodes A, B and C and you are given that the post-order traversal for the tree is B-A-C. The exact preorder traversal for the tree is. C-A-B A-B-C C-B-A A definite pre-order traversal cannot be determined from the information given
shgarg
asked
in
DS
Nov 6, 2018
by
shgarg
3.6k
views
data-structures
binary-tree
made-easy-booklet
tree-traversal
2
votes
2
answers
13
self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.
Vegeta
asked
in
DS
Jul 16, 2018
by
Vegeta
956
views
binary-tree
binary-search-tree
tree-traversal
0
votes
2
answers
14
Binary search tree pre-order
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 pre-order 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
amber12
asked
in
Study Resources
Jul 5, 2018
by
amber12
1.6k
views
binary-search-tree
tree-traversal
2
votes
1
answer
15
Tree , Preorder , depth-first order , breadth-first order
Preorder is same as : a) depth-first order b) breadth-first search c) topological order d) linear order
arya_stark
asked
in
DS
Jul 4, 2018
by
arya_stark
5.6k
views
data-structures
tree-traversal
2
votes
3
answers
16
ISRO2018-80
If $\text{Tree-1}$ and $\text{Tree-2}$ are the trees indicated below: Which traversals of $\text{Tree-1}$ and $\text{Tree-2}$, respectively, will produce the same sequence? Preorder, postorder Postorder, inorder Postorder, preorder Inorder, preorder
Arjun
asked
in
DS
Apr 22, 2018
by
Arjun
4.9k
views
isro2018
data-structures
tree-traversal
1
vote
0
answers
17
DS POST ORDER
WHAT IS THE POST ORDER IF ROOT NODE IS P?
iarnav
asked
in
DS
Jan 6, 2018
by
iarnav
457
views
tree-traversal
data-structures
post-order
8
votes
1
answer
18
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 ?
junaid ahmad
asked
in
Programming
Dec 19, 2017
by
junaid ahmad
739
views
tree-traversal
binary-tree
1
vote
2
answers
19
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 ?
aaru14
asked
in
Programming
Dec 7, 2017
by
aaru14
1.4k
views
made-easy-test-series
data-structures
tree
tree-traversal
2
votes
3
answers
20
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 in-order and post-order traversals of T produce the following sequences. in-order: a, b, c, d, e, f, g, h, i, j, k post-order: a, c, b, e, f, h, j, k, i, g, d How many leaves does the tree have?
Parshu gate
asked
in
DS
Nov 13, 2017
by
Parshu gate
3.6k
views
binary-tree
data-structures
tree-traversal
2
votes
3
answers
21
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 ________________.
Parshu gate
asked
in
DS
Nov 13, 2017
by
Parshu gate
2.4k
views
binary-tree
data-structures
tree-traversal
0
votes
1
answer
22
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.
humblefool
asked
in
DS
Nov 8, 2017
by
humblefool
800
views
data-structures
algorithms
binary-search-tree
binary-tree
tree-traversal
0
votes
0
answers
23
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).
Anu007
asked
in
Algorithms
Oct 24, 2017
by
Anu007
307
views
algorithms
tree-traversal
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged tree-traversal
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...