Types of Trees – Knowledge Check

1. 1. What distinguishes a general tree from a binary tree?

   General trees allow unlimited children per node; binary trees allow at most twoBinary trees allow unlimited children per node; general trees allow at most twoGeneral trees must be balanced; binary trees are always skewedBinary trees are always complete

2. 2. Which statement describes a Full Binary Tree?

   All levels filled except last, filled left to rightEvery node has either 0 or 2 childrenAll leaves at different depthsLeft subtree height equals right subtree height exactly

3. 3. A Complete Binary Tree is defined as:

   All internal nodes have two childrenAll levels completely filled, possibly except the last which is filled left to rightEvery root has exactly two childrenA tree where leaf depths differ by at most 1

4. 4. In a Balanced Binary Tree (conceptual), the height condition is:

   Every leaf is at the same depthLeft and right subtree heights differ by at most 1The number of nodes on the left equals the rightIt has the minimum possible number of nodes