Question
A programmer needs search-intensive applications requiring predictable logarithmic height, and the chosen structure has the property that each node’s balance factor is typically -1, 0, or 1. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. AVL Tree
Explanation:
AVL Tree fits because it supports search-intensive applications requiring predictable logarithmic height and each node's balance factor is typically -1, 0, or 1.
Both clues point to this choice.
Leave a Reply