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

List some applications of tree-data structure?

830

What is a matrix?

962

Define graph?

1053

Explain the Array

933

What is ascii sort order?

843

What does adt stands for?

822

Can we store a string and integer together in an array?

825

How to reverse a linked list iterative algorithm?

870

How remove all from arraylist?

876

How do you make a bubble chart with 3 variables?

846

What is a list in data structure?

867

Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

875

State the advantages of using postfix notations?

1004

Which sort is stable?

894

What is quick sort?

1004