24/10/2018
1
Data
Structure:
Stack
LECTURE 2
Stack Overview
Stack ADT
Basic operations of stack
Pushing, popping etc.
Implementations of stacks using
array
linked list
24/10/2018
2
The Stack ADT
Stack is a linear data structure which follows a
particular order in which the operations are
performed. The order may be LIFO(Last In First
Out) or FILO(First In Last Out).
Fundamental operations:
Push: Equivalent to an insert
Pop: Deletes the most recently inserted element
Top: Examines the most recently inserted element
Size: Number of elements a stack contains at present
Capacity: Number of elements it is capable of holding
Stack ADT
Stacks are less flexible
but are more efficient and easy to implement
Stacks are known as LIFO (Last In, First Out) lists or or
FILO(First In Last Out)The last element inserted will
The post Stack is a linear data structure appeared first on Assignment Freelancers.
