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 is array define its types?
What is a matrix? Explain its uses with an example
Why is it important to sort waste?
Write an algorithm to check if there is a loop in a doubly linked list.
What do you mean by the term “percolate down”?
Is array size dynamic or fixed?
What is difference between arraylist and linkedlist?
Is list a data structure?
What is dynamic array how it is created?
What are the different types of data structures?
Which sorting technique is faster?
Is linked list faster than array?
Why is sorting important?
Differentiate between the singly linked list and doubly linked list.
How efficient is binary search?