Register

Recent questions tagged tree-traversal

1 votes
3 answers
31
NIELIT 2018-80
_____ traversals are not sufficient to build a binary tree. Preorder and Inorder Postorder and Inorder Postorder and Preorder None of these
_____ traversals are not sufficient to build a binary tree.Preorder and InorderPostorder and InorderPostorder and PreorderNone of these
User Avatar
0 votes
0 answers
32
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
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....
User Avatar
2 votes
2 answers
33
self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.
How to Construct Full Binary Tree from given preorder and postorder?Thank you.
User Avatar
2 votes
1 answer
35
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
Preorder is same as :a) depth-first order b) breadth-first searchc) topological order d) linear order
User Avatar
2 votes
4 answers
36
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
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...
User Avatar
1 votes
0 answers
37
DS POST ORDER
WHAT IS THE POST ORDER IF ROOT NODE IS P?
WHAT IS THE POST ORDER IF ROOT NODE IS P?
User Avatar
8 votes
1 answer
38
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 ?
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...
User Avatar
1 votes
2 answers
39
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 ?
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 trave...
User Avatar
2 votes
3 answers
41
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 ________________.
For a binary tree T,preorder traversal yields: 11,8,6,4,7,10,19,43,31,29,37,49 andinorder traversal yields: 4,6,7,8,10,11,19,29,31,37,43,49The height of the T is _____...
User Avatar
0 votes
0 answers
43
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).
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 tim...
User Avatar
8 votes
3 answers
44
ISRO2017-50
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
If the post order traversal gives ab -cd * + then the label of the nodes 1,2,3.. will be+ , -, *, a,b,c,da, -,b,+,c,*,da,b,c,d,-,*,+-,a,b,+,*,c,d
User Avatar
0 votes
1 answer
46
coremen
why do we need preorder, postorder and inorder sequence/graph traversal?
why do we need preorder, postorder and inorder sequence/graph traversal?
User Avatar
0 votes
3 answers
47
Data Structure In-Order Predecessor
If a node in a BST has two children, then its in-order predecessor has a) No left child b) No right child c) 2 children d) no child
If a node in a BST has two children, then its in-order predecessor hasa) No left childb) No right childc) 2 childrend) no child
User Avatar
0 votes
0 answers
48
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??
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??
User Avatar
0 votes
1 answer
49
Say true or false?
preorder traversal of a tree resemble to the DFS traversal of graph?
preorder traversal of a tree resemble to the DFS traversal of graph?
User Avatar
2 votes
1 answer
52
GATE Overflow | Algorithms | Test 1 | Question: 14
The result of performing an inorder search on the given tree is s y x z v u t y s x z v u t s y v u t z x v u t z x y s
The result of performing an inorder search on the given tree iss y x z v u ty s x z v u ts y v u t z xv u t z x y s
User Avatar
1 votes
1 answer
53
UGC NET CSE | December 2015 | Part 2 | Question: 38
The inorder traversal of the following tree is $2 \, \, \, 3 \, \, \, 4 \, \, \, 6 \, \, \, 7 \, \, \, 13 \, \, \, 15 \, \, \, 17 \, \, \, 18 \, \, \, 18 \, \, \, 20$ ...
The inorder traversal of the following tree is$2 \, \, \, 3 \, \, \, 4 \, \, \, 6 \, \, \, 7 \, \, \, 13 \, \, \, 15 \, \, \, 17 \, \, \, 18 \, \, \, 18 \, \, \, 20$$20 \...
User Avatar
2 votes
1 answer
54
UGC NET CSE | Junet 2015 | Part 2 | Question: 23
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
Level order Traversal of a rooted Tree can be done by starting from root and performing:Breadth First SearchDepth First SearchRoot SearchDeep Search
User Avatar
3 votes
4 answers
57
ISRO2011-26
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result in FGBDECA ABFGCDE BFGCDEA AFGBDEC
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result inFGBDECAABFGCDEBFGCDEAAFGBDEC
User Avatar
Page: