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
- 106041 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / auradi
Double ended queue is the way in which a elements r inserted
and deleted from either end not been inserted from middle or
removed.....
I am Sure about this answer plz check tenenbam
Datastructure using c and c++ there is an explanation given
for this
| Is This Answer Correct ? | 25 Yes | 3 No |
Post New Answer View All Answers
Which sorting algorithm has minimum number of swaps?
Should I use hashmap or hashtable?
What are doubly linked lists?
What is a comparator function?
Describe the types of data structures?
Define shortest path?
What do you mean by Runtime Error
What is subtree?
In an avl tree, at explain what condition the balancing is to be done?
Describe the level term in a tree.
Does array sort mutate?
What is stable sorting method?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
Which sorting algorithm uses minimum number of swaps?
Differentiate between collection and collections.
