What binary tree type has every non-leaf node with exactly two children and all leaves at the same level, as described in the material?

What binary tree type has every non-leaf node with exactly two children and all leaves at the same level, as described in the material?

• A. Full Binary Tree
• B. Binary Search Tree
• C. Complete Binary Tree
• D. Skewed Binary Tree

Answer: (A)

This question tests recognizing a binary tree that has two key structural properties: every non-leaf node has exactly two children, and all leaves are at the same depth. When both conditions hold, the tree is commonly called a perfect binary tree, but the material labels this type as a Full Binary Tree. That label is the best match for describing a tree where internal nodes always split into two subtrees and every leaf sits at the same level. The other types don’t satisfy both conditions simultaneously. A Binary Search Tree cares about the ordering of values, not the exact shape. A Complete Binary Tree requires every level to be fully filled except possibly the last, which can introduce leaves at different depths. A Skewed Binary Tree has each node with only one child, so leaves are not all at the same level.

This question tests recognizing a binary tree that has two key structural properties: every non-leaf node has exactly two children, and all leaves are at the same depth. When both conditions hold, the tree is commonly called a perfect binary tree, but the material labels this type as a Full Binary Tree. That label is the best match for describing a tree where internal nodes always split into two subtrees and every leaf sits at the same level.

The other types don’t satisfy both conditions simultaneously. A Binary Search Tree cares about the ordering of values, not the exact shape. A Complete Binary Tree requires every level to be fully filled except possibly the last, which can introduce leaves at different depths. A Skewed Binary Tree has each node with only one child, so leaves are not all at the same level.