Q87
What data structure is most suitable for handling a fixed-size list where elements are frequently added and removed?
A.
Trie
B.
Heap
C.
Queue
D.
Circular Buffer
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board