In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94522 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
Is bubble sort faster than selection sort?
What method removes the value from the top of a stack?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
Why do we use data structures?
What is a pass in bubble sort?
What is the use of space complexity and time complexity?
Does array sort mutate?
What are the different types of data structures explain briefly?
What is stable sort example?
Explain what is B-tree?
What is a treemap chart?
Define an algorithm. What are the types of algorithms?
What is the purpose of sorting algorithms?
What is the limit of arraylist?
Describe queue operation.
