In which data structure, elements can be added or removed at
either end, but not in the middle?
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 are some of the best practices relating to the java collection framework?
Is heap sort adaptive?
Can we give size to arraylist?
Which is better merge or quick sort?
How do you find the depth of a binary tree?
What is difference between hashmap and hashset?
How do I rearrange rows in numbers?
How do you sort pseudocode?
Which sorting algorithm is considered the fastest?
What is raid (redundant array of inexpensive disks)?
Differentiate between hashset and hashmap.
What is an array vs list?
What is bubble sort in data structure?
How do you sort an array by value?
Differentiate among cycle, path, and circuit?