In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94610 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
What are the advantages of bubble sort?
Describe the complexity of Quick Sort
State the demerits of linked representation of binary trees?
What is the use of prototype?
Write a Program for Linked list manipulation.
What do you mean by garbage collection?
What do you mean by hash table?
Is binary tree a bst?
What are the two types of data?
Does hashmap sort automatically?
Is radix sort faster than quicksort?
Tell me how to find middle element of linked list in one pass?
Which sorting algorithm is the slowest?
How do you find the second largest element in an array of integers?
What is data and data structure?
