In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94608 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
In which data structure, elements can be added or removed at
either end, but not in the middle?..
Answer / amit tyagi
stack,because we can only do push-pull it at two ends nor
in middle.
| Is This Answer Correct ? | 12 Yes | 27 No |
In which data structure, elements can be added or removed at
either end, but not in the middle?..
More Data Structures Interview Questions
List the applications of queues?
Why might quick sort might be better than merge sort?
What is int data type?
How do you rotate an AVL tree?
What is immutablelist?
Which is faster array or linked list?
What is B+ tree?
6 Answers BMC, CMC, Satyam, TCS,
How will you check the validity of an expression containing nested parentheses?
What is difference between for loop and foreach?
How do I use quick sort?
How do you find the height of a binary tree?
What is bubble sort in data structure?
Windows 
