Stack can be described as a pointer. Explain.

Answer Posted / 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



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

When is a graph said to be weakly connected?

678


What are the two traversal strategies used in traversing a graph?

722


What are the Advantages and disadvantages of Array?

779


Does set allow null values?

606


What is binary tree in computer science?

674


How to cut or remove an element from the array?

716


Define binary tree insertion.

732


Why linked lists are better than arrays?

680


Why is it called bubble sort?

671


Which sort algorithm is best?

651


How can someone display singly linked list from first to last?

646


Define indegree of a graph?

857


How does a dynamic array work?

633


Explain the expression trees?

765


Can list contain null values?

638