Question
A programmer needs array-based heap representation, and the chosen structure has the property that nodes on the last level are as far left as possible. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Complete Binary Tree
Explanation:
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.
Leave a Reply