Virtual Labs

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

a: A node in a binary tree can 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 node in 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.

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 have any cycles Explanation

Explanation

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

Explanation

Tree Traversal