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 collision resolution methods?
Which sorting is worst?
What does isempty() member method determines?
What type of data structure is used to perform recursion?
List all data structures you would use for a memory management module.
What is array indexing?
Why is reflection slower?
What will be the output of below code?
Name few collections map implementations?
Which is better merge sort or quick sort?
Can an arraylist be null?
What are different types of linked lists?
Does concurrenthashmap allow null?
List the differences between comparable and comparator interface?
What is arraylist load factor?