Question
A programmer needs ordered dictionary operations with expected logarithmic time, and the chosen structure has the property that higher levels allow traversal to skip many nodes. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Skip List
Explanation:
Skip List fits because it supports ordered dictionary operations with expected logarithmic time and higher levels allow traversal to skip many nodes.
Both clues point to this choice.
Leave a Reply