Stack can be described as a pointer. Explain.
Answer Posted / mousumi
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 can be Described as a Pointer
| Is This Answer Correct ? | 6 Yes | 1 No |
Post New Answer View All Answers
What is meant by a dynamic array?
What is the difference between arrays sort and collections sort?
What is a data structure definition?
Two linked lists are given, find out the sum of them without altering the linked list?
Is hashmap keyset ordered?
How many sorting are there in data structure?
Explain multiply linked list in short.
How to sort 1 million floating point numbers?
What are the disadvantages of representing a stack or queue by a linked list?
Can hashmap have duplicate keys?
How can a binary tree be represented using the rotation?
What do you mean by probing?
Why is sorting important?
What is the use of sorting the data?
What are arrays used for?