Double Ended Queue is the right answer.

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

Question Posted / tasneem uddin

Answer Posted / tasneem uddin

Is This Answer Correct ?

25 Yes

0 No

Please Help Members By Posting Answers For Below Questions

Can treeset have duplicates?

960

Which is the parent class of sortedset class?

1059

What happens if an array goes out-of-bounds?

1125

What is comparable interface?

1007

Is arraylist faster than array?

964

How does max heap work?

956

How do you do a mergesort?

955

Why do we need sorting algorithms?

974

Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78

1681

Write the recursive c function to count the number of nodes present in a binary tree.

919

Can hashset contain duplicates?

1031

What is a tech stack?

928

Define the term “percolate down”?

1053

What is stack algorithm?

917

What is list data structure?

1020