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
- 104258 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / poornakala
linked list is not right. its two way stack. double ended
queue can also cannot be as u need to have 4 pointers for
them... but two way stack needs 2 pointers and can only be
deleted and inserted at the end.
| Is This Answer Correct ? | 17 Yes | 8 No |
Post New Answer View All Answers
What is a treemap used for?
What is selection in an algorithm?
Which is faster quick sort or merge sort?
Explain the common uses of tree database.
Is arraylist a list?
What is a property class?
What is an recursive algorithm?
What is mean by abstract data type?
Define right-in threaded tree?
What is difference between tree and binary tree?
Is treeset sorted?
What should I learn first data structures or algorithms?
Compare Queue and Topic ?
How can you insert a node to the beginning of a singly linked list?
Define an algorithm. What are the types of algorithms?
