Linked Stack and Linked Queue
Chapter 7
,Outline
● Introduction
– Linked Stacks
– Linked Queues
● Operations on Linked Stacks and Linked Queues
– Linked Stack Operations
– Linked Queue Operations
– Algorithms for Push/Pop operations on a Linked Stack
– Algorithms for Insert/Delete operations in a Linked Queue
● Dynamic memory management and Linked Stacks
● Implementation of Linked Representations
● Applications
– Balancing Symbols
– Polynomial Representation
, Introduction
● A linked stack is a linear list of elements commonly
implemented as a singly linked list whose start pointer
performs the role of the top pointer of a stack
● A linked queue is also a linear list of elements
commonly implemented as a singly linked list but with two
pointers viz., FRONT and REAR. The start pointer of the
singly linked list plays the role of FRONT while the pointer
to the last node is set to play the role of REAR.
Chapter 7
,Outline
● Introduction
– Linked Stacks
– Linked Queues
● Operations on Linked Stacks and Linked Queues
– Linked Stack Operations
– Linked Queue Operations
– Algorithms for Push/Pop operations on a Linked Stack
– Algorithms for Insert/Delete operations in a Linked Queue
● Dynamic memory management and Linked Stacks
● Implementation of Linked Representations
● Applications
– Balancing Symbols
– Polynomial Representation
, Introduction
● A linked stack is a linear list of elements commonly
implemented as a singly linked list whose start pointer
performs the role of the top pointer of a stack
● A linked queue is also a linear list of elements
commonly implemented as a singly linked list but with two
pointers viz., FRONT and REAR. The start pointer of the
singly linked list plays the role of FRONT while the pointer
to the last node is set to play the role of REAR.
