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
- 105762 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / chandrashaker
the answers above said(linked lists,stacks,queues)are not correct answers.the correct answer is "dqueus" also called it as double ended queue in which we can insert all the elements from front and rear
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is reduction to sorting method?
Is array immutable?
What does sorting an array do?
What are the properties of binary heap?
How do you empty an arraylist?
Explain Array of pointers?
what are the applications that use Linked lists?
Why do we study data structures?
What is a queue in data structure?
What is the procedure to insert into a sorted array?
Define in brief an array. What are the types of array operations?
Which data structure is used in arraylist?
What is ds heap sort?
How will you represent a linked list in a graphical view?
Which collection is fail safe?
