anil sharmalovely professional university unit stacks notes contents objectives introduction stack model implementation of stacks array-based implementation pointer-based implementation applications of stacks maze problem simulating recursive function using stack simulation of factorial summary keywords self assessment review questions further readings objectives after studying this unityou will be able todescribe the stack model explain the implementation and applications of stacks introduction stack is another linear data structure having very interesting property unlike arrays and link listsan element can be inserted and deleted not at any arbitrary position but only at one end thusone end of stack is sealed for insertion and deletion while the other end allows both the operations stack model stack is linear data structure in as much as its member elements are ordered as st ndand last howeveran element can be inserted in and deleted from only one end the other end remains sealed this open end to which elements can be inserted and deleted from is called stack top or top of the stack consequentlythe elements are removed from stack in the reverse order of insertion stack is said to possess lifo (last in first outproperty data structure has lifo property if the element that can be retrieved first is the one that was inserted last lovely professional university