Dequeue is the exactly Right answer........am 100% sure for it.........

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

Question Posted / naz

Answer Posted / naz

Dequeue is the exactly Right answer........am 100% sure for
it.........

Is This Answer Correct ?

22 Yes

0 No

Please Help Members By Posting Answers For Below Questions

What is difference between hashset and treeset?

1054

List out the disadvantages of using a linked list?

939

What is different between array and list?

929

What is the minimum number of queues that can be used to implement a priority queue?

952

Which sort is stable?

946

What is sort function?

891

How does the size of arraylist increases dynamically?

921

How do you sort large data?

967

What is merge sort and how it works?

830

What are the main differences between the linked list and linear array?

977

Can a hashset contain duplicates?

942

What is the meaning of anonymous array? Explain with an example?

1198

Is array size dynamic or fixed?

968

What is the difference between hashmap and linkedhashmap?

926

Should I use hashmap or hashtable?

883