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
- 105741 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 are the 3 control structures in programming?
What sorting algorithm does arrays sort use?
What is linked list ?
What are the properties of binary heap?
What is complete binary tree in data structure?
In Data Structure, write output of given program.
State the properties of b tree.
Does linkedhashset allow duplicates?
Is it legal to initialize list like this?
Why do we use hashmap?
What is thread and types of thread?
What is sorting and its types?
Does arraylist contain duplicates?
What are the different types of linked list?
Which sorting algorithm is best for large data?
