Question
A programmer needs implementing ordered maps and sets, and the chosen structure has the property that its rules guarantee logarithmic height without strict AVL-style balance. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Red-Black Tree
Explanation:
Red-Black Tree fits because it supports implementing ordered maps and sets and its rules guarantee logarithmic height without strict AVL-style balance.
Both clues point to this choice.
Leave a Reply