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
- 106974 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
Should I use hashmap or hashtable?
Which data structures are applied when dealing with a recursive function?
How many sorting techniques are there?
Which is better than array and linked list?
Do you know how to find if linked list has loop?
What is push and pop in stack?
What is the complexity of arrays sort?
What is difference between tree and binary tree?
Which method will arrange the element of an array in alphabetical order?
What is comparable interface?
What is the default value of Array?
What is max heapify?
What are vectors used for in real life?
What is binary tree in discrete mathematics?
What is the difference between 1d and 2d array?
