i think link list is wrong answer and deque is the correct ans thanks

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

Question Posted / sandeep

Answer Posted / sandeep

i think link list is wrong answer and deque is the correct ans
thanks

Is This Answer Correct ?

4 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Why is hashmap faster than treemap?

904

What is array traversing?

887

How does bogo sort work?

981

Is there any difference between int[] a and int a[]?

1159

Which language is best for data structures?

950

Sorting is not possible by using which of the methods?

918

Explain what is the type of the algorithm used in solving the 8 queens problem?

870

What is the best data structure and algorithm to implement cache?

955

What are hash tables good for?

911

Are hash tables ordered?

896

Does linked list allow duplicates?

883

Do you know what is linear search?

893

What is difference between stack and queue?

910

What is the complexity of sorting algorithm?

884

Can arraylist be null?

905