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
Write an algorithm to find middle element in the linked list.
What is the advantage of circular linked list?
What is a B tree?
How to create an Array?
What is queue example?
Why is quicksort not stable?
What is the default size of arraylist?
Why do we use hashset?
Differentiate between arraylist and vector.
Is bubble sort slow?
How many sorting are there in data structure?
List out the disadvantages of using a linked list?
Which is better merge sort or quick sort?
What is difference between list and array?
What is hashing in cyber security?