Stack can be described as a pointer. Explain.
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / kavitha
stack is last in first out property,so lastly pushed
element is poped out first.so when a pointer is pointed it
always points out the head pointer i.e the top element in
the stack.,so stack is also described as pointer.
Is This Answer Correct ? | 9 Yes | 1 No |
Answer / shweta
the TOP of Stack element is pointed by a pointer,when we
use PUSH and POP operations i.e. LIFO.
Is This Answer Correct ? | 10 Yes | 3 No |
Answer / 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 |
Answer / cse
Stack is also dynamic memory, without the hassle.
Dynamic memory uses pointers to check its value, free the
memory, etc.
Is This Answer Correct ? | 1 Yes | 1 No |
Which data structure is used to perform recursion?
How many passes does bubble sort need?
What actions are performed when a function is called?
What does arrays tostring do?
What do you mean by overflow and underflow?
Write a program using mergesort technique.
What is peep stack?
How do you sort a map by key?
How does quick sort work?
Does concat mutate array?
What is dynamic array how it is created?
What are the different data structures?