All MCQs

Full Binary Tree fits because it supports reasoning about strictly binary branching structures and no node has exactly one child.
Both clues point to this choice.

The defining property is that no node has exactly one child.
The other statements describe different structures or concepts.

Full Binary Tree is commonly used for reasoning about strictly binary branching structures.
Its design supports this task efficiently or naturally.

Full Binary Tree is a binary tree where every node has either zero or two children.
This description distinguishes it from the other choices.

Binary Tree fits because it supports representing hierarchical binary relationships and children are commonly called left and right.
Both clues point to this choice.

The defining property is that children are commonly called left and right.
The other statements describe different structures or concepts.

Binary Tree is commonly used for representing hierarchical binary relationships.
Its design supports this task efficiently or naturally.

Binary Tree is a tree in which each node has at most two children.
This description distinguishes it from the other choices.

Priority Queue fits because it supports event simulation and shortest-path algorithms and the highest- or lowest-priority item is served first.
Both clues point to this choice.

The defining property is that the highest- or lowest-priority item is served first.
The other statements describe different structures or concepts.

Priority Queue is commonly used for event simulation and shortest-path algorithms.
Its design supports this task efficiently or naturally.

Priority Queue is a structure that removes elements according to priority rather than arrival time.
This description distinguishes it from the other choices.