In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / sarmistha saha
double ended queue.
and i am sure about this
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the complexity of arraylist?
Is array size dynamic or fixed?
Does treeset remove duplicates?
Is queue fifo or lifo?
Which collection is used for sort?
How does a treemap work?
Explain merge sort algorithms.
What is the difference between array sort () and array sort t >()?
What is raid (redundant array of inexpensive disks)? Explain its level?
How does selection sort work?
What are the four characteristics of algorithms?
What is collection sort?
What is binary tree example?
How many links are there in a binary tree of N nodes?
Describe the level term in a tree.