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 |
Differentiate linear from non linear data structure?
Is python good for freshers?
What is the complexity of arrays sort?
What happens when arraylist is full?
What is the data structures used to perform recursion?
What is the structure of an array?
how to search an element in sorted linked list with time complexity is O(log n).
Is data structure a data type?
What do you mean by double hashing?
How do you find the second largest element in an array of integers?
What is structure of data type?
How can you correct these errors?