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 difference between treeset hashset linkedhashset?

925

How do you sort a map by key?

851

Is array a data structure?

1011

What are the 3 control structures in programming?

925

Name some applications which use linked lists.

997

What are sorting algorithms used for?

976

Tell me can the size of operator be used to tell the size of an array passed to a function?

1011

Can you dynamically allocate arrays in expanded memory?

1044

If you are using c language to implement the heterogeneous linked list, what pointer type should be used?

1065

Differentiate linear from a nonlinear data structure?

1063

Which is the parent class of linkedlist class?

1024

What are the disadvantages of linked list?

906

What are linear and non linear data structures?

868

Is treeset synchronized?

843

What is list and its types?

897