In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94622 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
How does quicksort partition work?
Is data structure a data type?
Can we apply binary search algorithm to a sorted linked list, why?
What is reduction to sorting method?
What is tree and its properties?
What is a simple graph?
What sort does arrays sort use?
What is the best sorting technique?
What is the space complexity of quicksort?
Explain what are the major data structures used in the network data model?
Why do we use sorting?
Which sorting is best for large data?
Define hash table?
What is data structure definition?
What are data members?
