In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / megha jain
Link list is not the right ans as insertion and deletion
can also b in the middle..... ans is Deck(Double Ended
Queue)
| Is This Answer Correct ? | 23 Yes | 2 No |
Post New Answer View All Answers
What do you mean by double hashing?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Define circular list?
Why quicksort is faster?
What does arraylist remove return?
Why is an array homogeneous?
Is hashmap fail safe?
What is the difference between list, set and map?
Is null allowed in list?
Is red black tree balanced?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Can we insert null in set?
What are scalar values?
What are the tasks performed while traversing a binary tree?
Can we declare array size as a negative number?