In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94518 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / vivek tiwari
I think that Linked List is not correct answer. Because
items can be added at middle.....
| Is This Answer Correct ? | 42 Yes | 3 No |
Post New Answer View All Answers
Which is better bubble sort or selection sort?
What is the difference between hashset and arraylist?
Define indegree of a graph?
Can you dynamically allocate arrays in expanded memory?
What are the major data structures used in the network data model?
What do you mean by separate chaining?
How can you insert a node to the beginning of a singly linked list?
What is the capacity of arraylist?
What are the types of algorithms?
Differentiate between arraylist and vector.
Which sorting algorithm has minimum number of swaps?
Is heap sort adaptive?
Devise a program to sort an array using bubble sort.
Differentiate between iterable and iterator.
What member function places a new node at the end of the linked list?
