Q62
Which data structure is best suited for a system that needs to efficiently manage and query non-overlapping intervals?
A.
Heap
B.
Trie
C.
Segment Tree
D.
Interval Tree
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board