Register

Recent questions tagged tree-traversal

2 votes
2 answers
1
Memory Based GATE DA 2024 | Question: 23
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree? Inorder + Preorder Preorder + Postorder Only Inorder Inorder + Postorder
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree?Inorder + PreorderPreorder + PostorderOnly InorderInorde...
User Avatar
1 votes
0 answers
4
DRDO CSE 2022 Paper 1 | Question: 30
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
User Avatar
1 votes
1 answer
5
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}$
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...
User Avatar
2 votes
2 answers
7
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
In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options
User Avatar
2 votes
1 answer
8
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.
Traversing a binary tree first root and then left and right subtrees called ______ traversal.postorder.preorder.inorder.none of these.
User Avatar
2 votes
4 answers
10
ISRO2020-23
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is $\text{A B C D E F G H I}$ $\text{F B A D C E G I H}$ $\text{F A B C D E G H I}$ $\text{A B D C E F G I H}$
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is$\text{A B C D E F G H I}$$\text{F B A D C E G I H}$$\text{F A B C D E G H I}$$\t...
User Avatar
0 votes
1 answer
12
Please solve this Q
User Avatar
0 votes
1 answer
13
ME TEST SERIES
User Avatar
0 votes
0 answers
14
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….
Acc. to (question) my solution is...uniquely constructed binary tree PRE+POST and IN+POST…where i am wrong….
User Avatar
Page: