In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / loveleen kaur
a deque is a linear list in which elements can be added or
removed at either end but not in the middle..it is the
contraction of name double ended queue..
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
What is the default size of an arraylist?
Write the postfix form of the expression: (a + b) * (c - d)
What do you mean by hash function?
What will be the output of below code?
how to insert a new node in linked list where free node will be available?
What is data in computer science?
Tell me how to find middle element of linked list in one pass?
How to copy an array into another array?
List the data structures which are used in rdbms, network data modal, and hierarchical data model.
What is map keyset?
Describe avl tree or height balanced binary search tree.
Differentiate between iterator and listiterator.
What is linear-logarithm chasm?
How do stacks work?
What is the space complexity of selection sort?