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

Can we change the size of an array at run time?

534


Which language is best for learning data structures and algorithms?

499


What is circular linked list?

527


Can you declare an array without assigning the size of an array?

521


How to sort an Array?

589






What is dynamic array in excel?

463


Is there any difference between int[] a and int a[]?

573


Is arraylist heterogeneous?

500


What is stack push?

464


how to display Singly Linked List from First to Last?

467


Is array size dynamic or fixed?

502


Is array a dynamic data structure?

516


State the difference between stacks and linked lists?

525


Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?

532


Differentiate linear from non linear data structure?

547