In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94828 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / naz
Dequeue is the exactly Right answer........am 100% sure for
it.........
| Is This Answer Correct ? | 22 Yes | 0 No |
Post New Answer View All Answers
Why do we need algorithm?
Which interfaces are implemented by abstractsequentiallist?
Why do we use sorting?
Can we increase the size of statically allocated array?
Can arraylist shrink?
What are b tree keys?
Why quicksort is faster?
How do you sort in ascending order in arraylist?
What is a pseudocode example?
Which is the fastest sorting?
What is copyonwritearraylist?
Can you sort a hashset?
Does arraylist guarantee insertion order?
Define non-terminal nodes in a tree?
What is difference between array and arraylist? When will you use array over arraylist?
