<h2>STACKS :</h2>A stack actually means a pile of objects, typically one that is neatly arranged. &nbsp;It actually means of arranging things one by one(from top to bottom) having only one way for input &amp; output . Think about arranging things in linear order" one on another" with top open , obviously we need to insert each element one after the other in a systematic matter.&nbsp;As bottom of box is completely closed so the “last added element will be the first removed element”, similarly "first added element is removed at last" stack involves of this operationsBefore we add an element we need to check if there is any space available for adding the &nbsp;element otherwise the provided stack will overflow&nbsp;browsing history involves stack for back pagewhen functions are called every recent function call need to be finished first and other gets resumed ex: recursion<h2>QUEUES:</h2>A queue actually means a line or sequence for attending something . It actually means of providing a sequence of arranging things in order (from top to bottom) having both ways of input &amp; output . let us consider an open box with open ends on both sides we started inserting n elements into the boxAs bottom of the box is open so the “first added element will be out first” similarly “last added element will be last ” queue involve of these operations . works on first come first basisBefore we add an element we need to check if there is any space available for adding the &nbsp;element otherwise the provided queue will overflow&nbsp;Ticket counter&nbsp;traffic at toll boothairport security check

India

P.BHARGAV SAI

Public

STACKS & QUEUES

STACKS :