A data structure where elements can be added or removed at either end but not in the middle is called …

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. A data structure where elements can be added or removed at either end but not in the middle is called …

(A) arrays
(B) stacks
(C) queues
(D) deque

💬 Discuss

✅ Correct Answer: (D) deque

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

972

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate