Q41
Which data structure is used for efficiently managing a list of elements with frequent insertions and deletions at both ends?
A.
Array
B.
Hash Table
C.
Deque
AnswerD.
Priority Queue
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board