Register

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

359 views
1 votes
1 votes
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 ___________
  1. $\Theta(n^3)$
  2. $\Theta(n)$
  3. $\Theta(n^2)$
  4. $\Theta(n\log n)$
User Avatar

1 Answer

Best answer
2 votes
2 votes
All the traversals can be done in $O(n)$ time. So, the total time complexity remains $O(n).$
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
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
1 votes
1 votes
1 answer
2
gatecse asked Aug 9, 2020
278 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 4
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively are Stack and Queue Queue and Stack Stack and Stack Queue and Queue
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively areStack and QueueQueue and StackStack and StackQueue and Queu...
User Avatar
1 votes
1 votes
1 answer
3
gatecse asked Aug 9, 2020
160 views
GATE Overflow Test Series | Data Structures | Test 1 | Question: 5
The prefix form of $A/B- (C * D * E)$ is? $-/* * ABCDE$ $-/ABCD**DE$ $-/AB**CDE$ $-A/BC*DE*$
The prefix form of $A/B- (C * D * E)$ is?$-/* * ABCDE$$-/ABCD DE$$-/AB CDE$$-A/BC*DE*$
User Avatar
Link Copied!