Stack can be described as a pointer. Explain.

Answer Posted / mousumi

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 can be Described as a Pointer

Is This Answer Correct ?    6 Yes 1 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Explain how to find 3rd element from end in a linked list in one pass?

649


How do you find the length of an arraylist?

652


Define level of the tree?

743


What are linked lists used for?

699


Can treeset have duplicates?

687


What is the advantage of the heap over a stack?

750


What are the Advantages and disadvantages of Array?

779


What is the logic to reverse the array?

656


how to display Singly Linked List from First to Last?

636


How many types of lists are there?

682


What is sort function?

674


How to pass in data structure exam?

701


What is a hash index?

630


Which file contains the definition of member functions?

683


Explain about map and their types?

785