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

Define right-in threaded tree?

560


What is immutablelist?

489


Explain the expression trees?

588


What is sorting in math?

526


Explain the difference between hashset and hashmap?

548






Why quicksort is faster?

493


List the data structures which are used in rdbms.

537


Differentiate between hashmap and hashtable.

627


What sort of serious problems have you experienced, and how have you handled them?

606


Calculate the address of a random element present in a 2d array, given base address as ba.

1084


Can we store a string and integer together in an array?

472


What are the different types of linked list?

476


What are the different data structures?

522


Why do we need linked list?

452


Give us a program to reverse a linked list.

557