Data Structures MCQs

Complete Binary Tree fits because it supports array-based heap representation and nodes on the last level are as far left as possible.
Both clues point to this choice.

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

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

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

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

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

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

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

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

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.

Circular Queue fits because it supports fixed-size buffering and the rear index can wrap to the beginning of the array.
Both clues point to this choice.

Deque is a double-ended queue supporting insertion and deletion at both ends.
This description distinguishes it from the other choices.