In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94527 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
What do you mean by Runtime Error
What do you know about different sorting algorithms?
What type of algorithm is binary search?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
What is queue example?
Does treemap preserve order?
Which is better than array and linked list?
Do you know what is linear search?
What does bubble sort do?
What is meant by hashing?
What is the purpose of sorting algorithms?
write a code for Implementation of stack and queues.
Is hashmap synchronized?
Which sorting method is slowest?
How many types of searching are there in data structure?
