Interested to Buy Any Domain ? << Click Here >> for more details...
Stack can be described as a pointer. Explain.
- 5 Answers
- 25609 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
Why is quicksort unstable?
Which is better bubble sort or selection sort?
Write an algorithm for inserting and deleting an element from doubly linked list?
What is difference between hashset and treeset?
Which sorting algorithm has minimum number of swaps?
What is the use of space complexity and time complexity?
How many types of searching are there in data structure?
What is an object array?
What is a pseudocode example?
Does treemap sort automatically?
Define a full binary tree ?
What is a stable algorithm?
Who invented merge sort?
Why is hashmap not thread safe?
What is collections singletonlist?
