In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / ujjwal dave
Stack and Queue are also not correct because in stack
elements can be added and deleted only from one end.
In queue addition takes place at one end and deletion from
other.....
we want to add elements at both ends.....so deques is the
only correct answer
| Is This Answer Correct ? | 17 Yes | 3 No |
Post New Answer View All Answers
What are the advantages of sorting and filtering data?
Is hashmap part of collection?
Which sorting technique is faster?
How can I search for data in a linked list?
How does bogo sort work?
Is quicksort a stable sorting algorithm?
How do you sort an arraylist?
Define binary tree insertion.
What is array and its types in data structure?
Discuss how to implement queue using stack.
What does simulation of queues mean?
Does treemap allow null key?
What is the difference between classifying and sorting?
Can arraylist be empty?
How do we search a specific element in an array?