In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / amit tyagi
stack,because we can only do push-pull it at two ends nor
in middle.
| Is This Answer Correct ? | 12 Yes | 27 No |
Post New Answer View All Answers
Which type of sorting is best?
What do you mean by data types?
What is binary tree give example?
Define degree of the node?
Can we add heterogeneous elements into treemap?
What do you mean by structure property in a heap?
What does quick sort do?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
How many null values are allowed in a set?
Is array a linked list?
Name two algorithms two find minimum spanning tree?
Explain exception filter?
What is ds tree?
Explain singly linked list in short.
Which interfaces are implemented by enumset?