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

How is the front of the queue calculated ?

1254

What are the tasks performed during postorder traversal?

1011

What is complete binary tree in data structure?

1037

What is frozenset?

957

Define an abstract data type (adt)?

1017

Can arraylist store objects?

1002

How do you access the values within an array?

1119

What are the disadvantages of using collection classes over arrays?

1121

Define secondary clustering?

985

Can hashtable have duplicate values?

965

What is difference between array and arraylist? When will you use array over arraylist?

1046

Tell me about the different sorting techniques.

979

Is array a linked list?

949

What is array indexing?

1071

How do you sort a list in reverse order?

881