Register

GATE Overflow Test Series | Data Structures | Test 1 | Question: 4

• edited by
278 views
1 votes
1 votes

The data structures most suitable to do an inorder and level order traversals of a binary tree respectively are

  1. Stack and Queue
  2. Queue and Stack
  3. Stack and Stack
  4. Queue and Queue
• edited by
User Avatar

1 Answer

Best answer
1 votes
1 votes
Inorder  traversal (Left, Root, Right) : Stack

Level order traversal (or) Breadth first traversal: Queue

So, the correct answer is $(A).$
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
2
gatecse asked Aug 9, 2020
178 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 6
Which of the following is not a valid sequence of key traversals while searching the key $44$ in a binary search tree? $11,88,22,77,33,66,44$ $11,22,33,44$ $88,11,22,77,55,44$ $66,11,22,77,33,44$
Which of the following is not a valid sequence of key traversals while searching the key $44$ in a binary search tree?$11,88,22,77,33,66,44$$11,22,33,44$$88,11,22,77,55,4...
User Avatar
1 votes
1 votes
1 answer
3
gatecse asked Aug 9, 2020
358 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 2
Kevin is asked to write a single program to print the inorder, preorder, postorder and level order traversal of a binary tree having $n$ nodes. The best possible time complexity of this function is ___________ $\Theta(n^3)$ $\Theta(n)$ $\Theta(n^2)$ $\Theta(n\log n)$
Kevin is asked to write a single program to print the inorder, preorder, postorder and level order traversal of a binary tree having $n$ nodes. The best possible time com...
User Avatar
1 votes
1 votes
1 answer
4
gatecse asked Aug 9, 2020
185 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 3
What is the value of the postfix expression $8 \ 7 \ 2 \ 4 \ + \ – \ *?$:
What is the value of the postfix expression $8 \ 7 \ 2 \ 4 \ + \ – \ *?$:
User Avatar
Link Copied!