Stack (Abstract Data Type) Implementations.

By Wathsara Wishwantha Daluwatta

• What is ADT(Abstract Data Type)?
• An abstract data type is a mathematical model together with a set of operations defined on that model.
• ADTs are independent of data representation and implementation of operations.

 

•  What is a Stack?
• A stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle.
•  Stack is a ADT with two main principal operations
• Push-Adds an element to the collection.
• Pop- Removes the most recently added element.
• Consider as a linear data Structure.

LIFO(Last In Frist Out)

• A stack can be easily implemented either through an Array or a Linked List

•   Stack Implementation Using Python(python 3.3.3).

 

python 3.3.3

• Stack Implementation Using Python through Linked List. 

Through Linked List

• Stack Implementation Using Scala.
• Using List 

  

  Using List

• Using Array

  

  Using Array

Thank You.

Stay Touch With us for more.

Wathsara Wishwantha Daluwatta