Virtual Labs

1. Which of the following statements is correct about a binary tree?

a: A node in a binary tree must have exactly two children Explanation

Explanation

b: A node in a binary tree can have at most two children Explanation

Explanation

c: A node in a binary tree can have two or more children Explanation

Explanation

d: A binary tree can have more than one root Explanation

Explanation

2. Node values in a binary tree always appear in a sorted order from root to leaf, going left to right at each level.

a: True Explanation

Explanation

b: False Explanation

Explanation

3. Which of the following is TRUE about the leaf nodes of a binary tree?

a: Leaf nodes in a binary tree have no children Explanation

Explanation

b: At least one leaf node in a binary tree has two children Explanation

Explanation

c: Leaf nodes in a binary tree are allowed to have more than two children Explanation

Explanation

d: Leaf nodes in a binary tree may or may not have child nodes Explanation

Explanation

4. In a binary tree, all nodes are connected through parent-child relationships.

a: True Explanation

Explanation

b: False Explanation

Explanation

5. Which of the following is TRUE about a binary tree?

a: There exists a cycle between nodes in a binary tree Explanation

Explanation

b: There may or may not be a cycle in a binary tree Explanation

Explanation

c: A binary tree does not contain any cycles Explanation

Explanation

d: There should be at least one cycle in a binary tree Explanation

Explanation

6. Which traversal visits the root node before its left and right subtrees?

a: Inorder traversal Explanation

Explanation

b: Postorder traversal Explanation

Explanation

c: Preorder traversal Explanation

Explanation

d: Level-order traversal Explanation

Explanation

7. Which traversal follows the order Left Subtree - Root - Right Subtree?

a: Preorder traversal Explanation

Explanation

b: Inorder traversal Explanation

Explanation

c: Postorder traversal Explanation

Explanation

d: Level-order traversal Explanation

Explanation

8. A binary tree contains

n

nodes. How many nodes should a complete traversal visit?

n

Explanation

n - 1

Explanation

2n

Explanation

n + 1

Explanation

9. Which statement best distinguishes a binary tree from a binary search tree?

a: A binary tree must store values in sorted order, while a binary search tree does not Explanation

Explanation

b: A binary search tree can have more than two children per node Explanation

Explanation

c: A binary tree cannot be traversed using inorder traversal Explanation

Explanation

d: A binary search tree has an ordering property for node values, while a general binary tree does not Explanation

Explanation

Tree Traversal