In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94589 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
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Why is concurrenthashmap thread safe?
Why do we need sorting?
What can be stored in an arraylist?
What is the use of prototype?
Which data structures are used in bfs and dfs algorithm?
Is arraylist a list?
Which interfaces are implemented by abstractsequentiallist?
What is the similarity between a Structure, Union and enumeration?
What do you mean by spanning tree?
Define binary tree insertion.
Is quicksort divide and conquer?
What is Doubly link list?
Are the expressions arr and &arr same for an array of integers?
Can we store primitives in collections?
