In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / pinky
a double ended queue
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Can arraylist contain duplicates?
Is treeset synchronized?
Do all declaration statements result in a fixed reservation in memory?
Which collection is fail safe?
Why is hashmap faster than treemap?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
Which is faster hashmap or hashtable?
What is a stable algorithm?
When is a binary search best applied?
What is a undirected graph?
Is heap sort stable?
How do you sort a collection in descending order?
Define depth and height of a tree?
Explain the term tail recursion?
Give the example of validating the parenthesis of expression using stack.