Stack can be described as a pointer. Explain.
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
What are the advantages of binary search over linear search?
What are the issues that hamper the efficiency in sorting a file?
Does hashset guarantee order?
Define static data structures?
What is comparable interface?
Describe the complexity of Quick Sort
What is an array vs list?
What is the difference between arraylist and linkedlist?
Explain the most efficient method to reverse a linked list?
Tell me about the different sorting techniques.
What is top in stack?
Who invented quicksort?
Does arraylist extend list?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Is arraylist synchronized?