Interested to Buy Any Domain ? << Click Here >> for more details...
In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 104227 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / tasneem uddin
Double Ended Queue is the right answer.
| Is This Answer Correct ? | 25 Yes | 0 No |
Post New Answer View All Answers
Why is quicksort so fast?
Can we change the size of an array at run time?
State the different types of linked lists?
What happens in insertion sort?
What are different sorting algorithms?
What do you mean by back edge?
Define balanced trees?
Which sort is best for linked list?
Explain the most efficient method to reverse a linked list?
How can you add an item to the beginning of the list?
Differentiate between queue and stack.
Can hashmap store null values?
What is the difference between list, set and map?
What is concurrentlinkeddeque?
What should I learn first data structures or algorithms?
