CSE Faculty - Chapter 3: STACK (part a)

Contiguous Stack Applications of Stack

.Linear List Concepts

LIFO (Stack)

.Stack ADT
DEFINITION: A Stack of elements of type T is a finite sequence of elements of T, in which all insertions and deletions are restricted to one end, called the top. Stack is a Last In - First Out (LIFO) data structure.
Basic operations: • Construct a stack, leaving it empty.

• Push an element. • Pop an element. • Top an element.