In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 99428 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
What is data algorithm?
Explain pre-order and in-order tree traversal.
What do you mean by data types?
How do you reference all the elements in a one-dimension array?
Are lists mutable?
What exactly is a thread?
What do you mean by the term “percolate down”?
What method is used to place a value onto the top of a stack?
Why null is allowed in hashmap?
What is arraylist load factor?
What type of variable is age?
For which header list, the last node contains the null pointer?
What are the two traversal strategies used in traversing a graph?
How do we search a specific element in an array?
Can we store null in arraylist?
