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
- 104265 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 to traverse data in a linked list in forward and backward direction, write the algorithm?
What are the average and worst time complexity in a sorted binary tree is
Define red-black trees.
Which sorting is worst?
What is collection process?
Define an algorithm. What are the types of algorithms?
What is the Difference between treemap and hashmap?
Is file a data structure?
What is the use of threaded binary tree?
Is arraylist reference type?
What is a concurrenthashmap?
What is the use of hashtable?
What the principle of quick sort and its complexity?
Can you change size of array once created?
List the two important key points of depth first search?
