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 language is best for learning data structures and algorithms?
Explain Queue
Which of the collections allows null as the key?
What are the Differences between map and hashmap?
Why is treeset sorted?
How many types of linked lists are there?
Can arraylist shrink?
Which is the parent class of abstractqueue class?
Define root?
What is a B tree?
0 Answers Akamai Technologies,
Differentiate between an array and an arraylist.
Explain binary search tree?