Stack can be described as a pointer. Explain.
Answer Posted / pramod
Because stack will contain a head pointer which will always
point to the top of the Stack.
All Stack Operations are done using Head Pointer. Hence
Stack ca be Described as a Pointer
| Is This Answer Correct ? | 50 Yes | 4 No |
Post New Answer View All Answers
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What is inserting in data structure?
What do you mean by balance factor of a node in avl tree?
What is an externalizable interface?
How do you find the length of an arraylist?
Write a Program for Insert in a sorted list
How many times is merge sort called?
What is the main advantage of a linked list?
Is hashmap faster than arraylist?
Which is the parent class of deque
Define articulation point?
Define depth and height of a tree?
Can we change the size of an array at run time?
Is heap sort faster than quicksort?
What is dynamic data structure?