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 do you understand by doubly linked list?
When is a binary search best applied?
Can hashmap be sorted?
Explain what is the type of the algorithm used in solving the 8 queens problem?
What is complexity algorithm?
What is a static structure?
Why use a tuple instead of a list?
What are AVL trees?
What does bubble sort do?
What is the Insertion Sort Code?.
What is circular queue example?
What is bubble insertion selection sort?
What is the difference between array and stack in data structures?
How does the bubble sort work?
What is the space complexity of quicksort?