Virtual Labs

1. Let us consider

V

to be the total number of vertices and

E

to be the total number of edges in a tree. What is the time complexity of Depth First Traversal in this tree?

O(V)

Explanation

O(V + E)

Explanation

O(E)

Explanation

d: None of the mentioned Explanation

Explanation

2. While performing inorder traversal in a tree, what is the sequence of nodes that gets visited?

a: Left Subtree - Root - Right Subtree Explanation

Explanation

b: Right Subtree - Root - Left Subtree Explanation

Explanation

c: Root - Left Subtree - Right Subtree Explanation

Explanation

d: None of the mentioned Explanation

Explanation

3. While performing preorder traversal in a tree, what is the sequence of nodes that gets followed?

a: Left Subtree - Root - Right Subtree Explanation

Explanation

b: Left Subtree - Right Subtree - Root Explanation

Explanation

c: Root - Left Subtree - Right Subtree Explanation

Explanation

d: None of the mentioned Explanation

Explanation

4. For the postorder traversal in the binary tree, what is the sequence of nodes that gets accessed?

a: Left Subtree - Root - Right Subtree Explanation

Explanation

b: Left Subtree - Right Subtree - Root Explanation

Explanation

c: Root - Left Subtree - Right Subtree Explanation

Explanation

d: None of the above Explanation

Explanation

5. Which of the following is a Depth First Traversal of a binary tree?

a: Level-order traversal Explanation

Explanation

b: Breadth First Traversal Explanation

Explanation

c: Inorder traversal Explanation

Explanation

d: Level-by-level traversal Explanation

Explanation

6. Consider a binary tree with root

A

, left child

B

, and right child

C

. If

B

has children

D

and

E

, what is the preorder traversal?

a: D, B, E, A, C Explanation

Explanation

b: A, B, D, E, C Explanation

Explanation

c: D, E, B, C, A Explanation

Explanation

d: A, C, B, D, E Explanation

Explanation

7. Consider the same tree with root

A

, left child

B

, right child

C

, and children

D

and

E

under

B

. What is the inorder traversal?

a: A, B, D, E, C Explanation

Explanation

b: D, B, E, A, C Explanation

Explanation

c: D, E, B, C, A Explanation

Explanation

d: A, C, B, E, D Explanation

Explanation

8. Consider a binary tree with root

A

, left child

B

, right child

C

, and children

D

and

E

under

B

. What is the postorder traversal?

a: D, E, B, C, A Explanation

Explanation

b: A, B, D, E, C Explanation

Explanation

c: D, B, E, A, C Explanation

Explanation

d: A, C, B, E, D Explanation

Explanation

9. Which statement about recursive Depth First Traversal is correct?

a: It does not require any mechanism to remember traversal state Explanation

Explanation

b: It always visits nodes level by level Explanation

Explanation

c: It can use the call stack to keep track of recursive traversal state Explanation

Explanation

d: It can traverse only trees with exactly two children at every node Explanation

Explanation

Tree Traversal