Question
A programmer needs ordered searching and dynamic set operations, and the chosen structure has the property that an inorder traversal produces keys in sorted order. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Binary Search Tree
Explanation:
Binary Search Tree fits because it supports ordered searching and dynamic set operations and an inorder traversal produces keys in sorted order.
Both clues point to this choice.
Leave a Reply