In which data structure, elements can be added or removed at
either end, but not in the middle?
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 |
Post New Answer View All Answers
In rdbms, explain what is the efficient data structure used in the internal storage representation?
Are the expressions arr and &arr same for an array of integers?
Does treeset remove duplicates?
How do you find the second largest element in an array of integers?
Which is the parent class of list
Which is faster quick sort or merge sort?
Who created quicksort?
How do you do a heap sort?
Which sorting is best and why?
What is indexing an array?
What is treemap chart?
Differentiate between file and structure storage structure.
How does quick sort work?
Program to remove duplicate elements in an array.
What is the space complexity of quicksort?