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
- 105871 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 sorting with example?
What is data structure? Explain.
Reverse a linked list from the middle.
How is the front of the queue calculated in data structure?
How does hashset maintain order?
State the merits of linear representation of binary trees?
What is a hashers run?
Explain binary representation?
Is an arraylist an object?
What do you mean by structure property in a heap?
How to sequentially represent max-heap?
Advanced problems related to Data Structures were asked
What is a string or array type?
Which is faster hashmap or concurrenthashmap?
Why you need a data structure?
