Interested to Buy Any Domain ? << Click Here >> for more details...
Stack can be described as a pointer. Explain.
- 5 Answers
- 26013 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
How to create your own data structure in java?
Write code for reversing a linked list.
What is difference between tree and binary tree?
Explain binary representation?
What is heap tree?
What is the space complexity of bubble sort?
Is bubble sort adaptive?
Why quicksort is faster than merge sort?
What does adt stands for?
What is comparable interface?
How does a heap sort work?
Can map contain duplicate keys?
What is bubble sort and quick sort?
Does treeset allow null values?
Is selection sort greedy?
