dequeue is the correct answer.unlike queues elements can be added at both

In which data structure, elements can be added or removed at
either end, but not in the middle?

Question Posted / sumit

Answer Posted / sumit

dequeue is the correct answer.unlike queues elements can be
added at both ends rather than one end ,but not in the middle..

Is This Answer Correct ?

22 Yes

4 No

Please Help Members By Posting Answers For Below Questions

What is the use of sorting?

1015

Explain the difference between a list and array.

1012

What is the prerequisite for binary searching?

1099

Define a complete binary tree?

985

What stack means?

962

What is a stable sorting algorithm?

1146

Explain quick sort?

1010

What is a treeset?

937

How many types of priority queue are there?

964

Is quicksort a stable sorting algorithm?

1050

Explain the difference between hashset and hashmap?

1171

Which sorting has less time complexity?

977

How to show internal storage representation of data structure in RDBM?

1032

Is unordered_map a hash table?

913

Does stringutils isempty check for null?

860