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
- 105885 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 huffman’s algorithm?
How to get the index of an array element?
Why might quick sort might be better than merge sort?
What is shell sort in data structure?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
What is adt in data structure with example?
Questions related to arrays, such as given a 2 integer array, find the common elements.
Is char array null terminated?
Can we search the data in a linked list?
What does arrays tostring do?
Are dictionaries mutable?
What is entryset in hashmap?
Differentiate between the singly linked list and doubly linked list.
Explain binary representation?
Which sorting is best and why?
