Virtual Labs

1. Which of the following is true about tree traversal?

a: A tree can be traversed only in a linear fashion like an array Explanation

Explanation

b: A tree can be traversed only in breadth first order Explanation

Explanation

c: A tree can be traversed only in depth first order Explanation

Explanation

d: A tree can be traversed using both breadth first and depth first orders Explanation

Explanation

2. Which of the following is true about Breadth First Traversal?

a: In Breadth First Traversal, nodes can be visited in any arbitrary order Explanation

Explanation

b: In Breadth First Traversal, nodes are traversed level by level Explanation

Explanation

c: In Breadth First Traversal, nodes are always traversed by following one branch to its deepest node Explanation

Explanation

d: Breadth First Traversal visits only the leaf nodes Explanation

Explanation

3. Select the option which is TRUE.

a: A traversal of a tree does not involve visiting all the nodes Explanation

Explanation

b: Traversing a tree means visiting each node in a specified order, covering all the nodes Explanation

Explanation

c: A tree traversal must stop as soon as a leaf node is encountered Explanation

Explanation

d: A tree can be traversed only when all nodes have two children Explanation

Explanation

4. 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

5. Which of the following is the correct order for preorder traversal?

a: Left Subtree - Root - Right Subtree Explanation

Explanation

b: Root - Left Subtree - Right Subtree Explanation

Explanation

c: Left Subtree - Right Subtree - Root Explanation

Explanation

d: Right Subtree - Root - Left Subtree Explanation

Explanation

6. Which of the following is the correct order for postorder traversal?

a: Root - Left Subtree - Right Subtree Explanation

Explanation

b: Left Subtree - Root - Right Subtree Explanation

Explanation

c: Left Subtree - Right Subtree - Root Explanation

Explanation

d: Root - Right Subtree - Left Subtree Explanation

Explanation

7. Which data structure is commonly used to implement Breadth First Traversal?

a: Queue Explanation

Explanation

b: Stack Explanation

Explanation

c: Heap Explanation

Explanation

d: Binary search tree Explanation

Explanation

8. Which statement correctly compares preorder, inorder, and postorder traversal?

a: They all visit the root at exactly the same position Explanation

Explanation

b: They differ in the position at which the root is visited relative to its subtrees Explanation

Explanation

c: They can be used only for trees containing numeric values Explanation

Explanation

d: They are all forms of Breadth First Traversal Explanation

Explanation

9. A binary tree has

n

nodes. What is the time complexity of visiting every node exactly once during a standard tree traversal?

O(1)

Explanation

O(\log n)

Explanation

O(n)

Explanation

O(n^2)

Explanation

Tree Traversal