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
Mention the data structures which are used in graph implementation.
What is difference between array and arraylist? When will you use array over arraylist?
How can we reverse the order in the treemap?
What is a directed graph?
In what order the elements of a hashset are retrieved?
State the advantages of using postfix notations?
Is hashmap get thread safe?
Tell me the difference between structure and array?
Can the double-checked locking fail on a single processor system?
Which is the parent class of printerstatereasons class?
Explain what is a spanning tree?
What is declaring array?
Can we insert null in list?
You want to insert a new item in a binary search tree. How would you do it?
Can you declare an array without assigning the size of an array?