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
- 105681 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / loveleen kaur
a deque is a linear list in which elements can be added or
removed at either end but not in the middle..it is the
contraction of name double ended queue..
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
Describe linear probing with an example.
Explain multiply linked list in short.
What is data algorithm?
Differentiate bfs and dfs?
Why do we use trees in data structures?
Can we create a null as a key for a map collection?
What is time complexity of bubble sort?
Should I use hashmap or hashtable?
What do you mean by overflow and underflow?
how to add an item to the beginning of the list?
What is sorting explain?
What is an acyclic graph?
What is sort function?
How can we delete the first node from the singly linked list?
Is binary tree a binary search tree?
