We have the best collection of Inorder Traversal MCQs and answer with FREE PDF. These Inorder Traversal MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Inorder Traversal MCQs

**1. What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)**

a) O(1)

b) O(nlogd)

c) O(logd)

d) O(d)

**Answer: **d

**2. For the tree below, write the in-order traversal.**

a) 6, 2, 5, 7, 11, 2, 5, 9, 4

b) 6, 5, 2, 11, 7, 4, 9, 5, 2

c) 2, 7, 2, 6, 5, 11, 5, 9, 4

d) 2, 7, 6, 5, 11, 2, 9, 5, 4

**Answer: **a

**3****. For the tree below, write the level-order traversal.**

b) 2, 7, 5, 2, 11, 9, 6, 5, 4

c) 2, 5, 11, 6, 7, 4, 9, 5, 2

d) 2, 7, 5, 6, 11, 2, 5, 4, 9

**Answer: **b

**4. What is the time complexity of level order traversal?**

a) O(1)

b) O(n)

c) O(logn)

d) O(nlogn)

**Answer: **b

**5. Which of the following graph traversals closely imitates level order traversal of a binary tree?**

a) Depth First Search

b) Breadth First Search

c) Depth & Breadth First Search

d) Binary Search

**Answer: **b

**6. In a binary search tree, which of the following traversals would print the numbers in the ascending order?**

a) Level-order traversal

b) Pre-order traversal

c) Post-order traversal

d) In-order traversal

**Answer: **d