In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / guest
stack
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
How do you increase the capacity of an arraylist?
Which is better hashmap or treemap?
Why hashmap is faster than hashtable?
What do you mean by an Array?
What is quick sort example?
How will you free the memory that is allocated at run time?
What is breadth first tree?
What is 1d array?
Is arraylist a list?
Is stack a dynamic data structure?
Tell me about the different sorting techniques.
Is heap sort faster than quicksort?
List some applications of tree-data structure?
If we try to add duplicate key to the hashmap, what will happen?
Explain the term base case?