1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Representation of stacks
Examples:
• Pile of tray in cadet area.
• Shunting for railway boogies system.
IMPEMENTATION OF STACKS
Stacks can be implemented in two ways:
• Static implementation
• Dynamic implementation
•
STATIC IMPLEMENTATION:
This kind of implementation uses arrays to create stack . The array
implementation o stack is not the flexible technique because the size of the
array is fixed . If there is few elements to be stored in the stack then the
statically allocated memory will be wasted and if there are more no. of
elements to be stored in the stack then we can’t be able to change the size of
array to increase its capacity.
DYANAMIC IMPLEMENTATION:
In this kind of implementation array is represented in the form of linked list by
using pointers to implement the stacks type of data structure.
Example :
• Int a[7]
we have to insert four elements 10,20,30,40 in the array.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 160 ‐