KUMAR SHIVAM

Define stacks . Explain implementation of stacks ? 

Data Structures and Algorithms

Answer in Short

A stack is linear Data Sturcture in which items are added (pushed, inserted) and removed(pop, deleted) from one end called top. Various steps involved in implementation of stacks are

Explanation

973    0

==> Stacks--

  • A stack is linear Data Sturcture in which items are added (pushed, inserted) and removed(pop, deleted) from one end called top.
  • A stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle. In the stacks only two operations are allowed: push the item into the stack, and pop the item out of the stack





Share:   

More Questions from Data Structures and Algorithms Module 2