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

In rdbms, explain what is the efficient data structure used in the internal storage representation?

999

Are the expressions arr and &arr same for an array of integers?

1047

Does treeset remove duplicates?

973

How do you find the second largest element in an array of integers?

1128

Which is the parent class of list class?

957

Which is faster quick sort or merge sort?

884

Who created quicksort?

1021

How do you do a heap sort?

923

Which sorting is best and why?

959

What is indexing an array?

1175

What is treemap chart?

930

Differentiate between file and structure storage structure.

1015

How does quick sort work?

991

Program to remove duplicate elements in an array.

1072

What is the space complexity of quicksort?

956