Interested to Buy Any Domain ? << Click Here >> for more details...
In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 104221 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / achintya shankar adhikari
it must b DEQUEUE,where elements can be added or removed at
either end,but not from the middle end..
| Is This Answer Correct ? | 25 Yes | 3 No |
Post New Answer View All Answers
What is collection process?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What is internal and external sorting?
How do you find the number of comparisons in bubble sort?
What is non linear data structure with example?
Reverse a linked list from the middle.
Is linked list faster than array?
Explain singly linked list in short.
What do you mean by data types?
Can treeset contain null?
Which is faster hashmap or hashset?
What do you mean by spanning tree?
Define threaded binary tree.
What is a comparator function?
Can we create a null as a key for a map collection?
