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
- 106935 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / saran
deque is the correct one because the elments can be added or removed in both direction ie front and rear.......
but not in the middle
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the advantage of circular linked list?
What does sorting an array do?
Is hashmap faster than arraylist?
What are different methods of collision resolution in hashing.
Write an algorithm to show the reverse of link list?
Why might quick sort might be better than merge sort?
What is meant by a dynamic array?
Why is hashmap faster than arraylist?
What is data structure and why it is important?
What is an example of an array?
When would you use a hashmap?
What are linked lists good for?
How helpful is abstract data type of data structures?
State the difference between persistent and ephemeral data structure?
What is the structure of an array?
