deque is the correct one because the elments can be added or removed in bot

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

Question Posted / saran

Answer Posted / saran

deque is the correct one because the elments can be added or removed in both direction ie front and rear.......
but not in the middle

Is This Answer Correct ?

0 Yes

0 No

Please Help Members By Posting Answers For Below Questions

What is data in computer science?

930

Why is quicksort faster than merge sort?

927

Why is treeset sorted?

980

Can binary tree have 1 child?

891

Differentiate stack from array?

941

Tell me do array subscripts always start with zero?

877

What is data type explain?

1095

Define threaded binary tree. Explain its common uses

870

Does concurrenthashmap allow null?

926

Does list maintain insertion order?

881

What is an externalizable interface?

966

Does treemap sort on key or value?

887

Can arraylist store int?

1045

Which process places data at the back of the queue?

1136

What is a simple path?

985