In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / sumit
dequeue is the correct answer.unlike queues elements can be
added at both ends rather than one end ,but not in the middle..
| Is This Answer Correct ? | 22 Yes | 4 No |
Post New Answer View All Answers
What is difference between treeset hashset linkedhashset?
How do you sort a map by key?
Is array a data structure?
What are the 3 control structures in programming?
Name some applications which use linked lists.
What are sorting algorithms used for?
Tell me can the size of operator be used to tell the size of an array passed to a function?
Can you dynamically allocate arrays in expanded memory?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Differentiate linear from a nonlinear data structure?
Which is the parent class of linkedlist class?
What are the disadvantages of linked list?
What are linear and non linear data structures?
Is treeset synchronized?
What is list and its types?