Answer Posted / punam & sunita
a deque is a abstract data structure in which insertion and
delection takes place at either side i.e. at rear & front
but not at middle.
| Is This Answer Correct ? | 37 Yes | 2 No |
Post New Answer View All Answers
What are linked lists most commonly used for?
Explain the uses of matrix with an example?
How to check array contains value or not?
List the applications of stacks?
What is the difference between linked list and array?
What is time complexity of quick sort?
What happens if we try to insert duplicate key in hashmap?
Is hashmap keyset ordered?
Is hashtable fail fast?
How efficient is binary search?
What is indexing an array?
What is time complexity of arrays sort?
How is bubble sort done?
Is file a data structure?
Differentiate between hashmap and treemap.
