In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / amit tyagi
stack,because we can only do push-pull it at two ends nor
in middle.
| Is This Answer Correct ? | 12 Yes | 27 No |
Post New Answer View All Answers
Is radix sort stable?
Which searching algorithm is best?
Does treemap preserve order?
Write an algorithm to find middle element in the linked list.
Define balanced trees?
What are the different binary tree traversal techniques?
Which is faster binary or linear search?
What is heap tree explain with example?
Which sort algorithm is best?
How efficient is bubble sort?
What is range search?
Define shortest path?
What is the difference between array sort () and array sort t >()?
Is it legal to initialize list like this?
What is a graph?