In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / achintya shankar adhikari
it must b DEQUEUE,where elements can be added or removed at
either end,but not from the middle end..
| Is This Answer Correct ? | 25 Yes | 3 No |
Post New Answer View All Answers
What are trees in data structures?
What is difference between list and array list?
What is sorted list in data structure?
How do treesets work internally?
What is default size of hashmap?
Data structure used to implement a menu
Is array a collection?
What is b tree in data structure?
Which sorting is best for large data?
What is sorting an array?
What are some of the best practices relating to the java collection framework?
Who invented quicksort?
Which algorithm is used in arrays sort?
What is a treeset?
Will hashmap allow null keys?