├── README.md
├── stack-using-array2.zip
├── stack-using-linked-list2.zip
└── stack.zip


/README.md:
--------------------------------------------------------------------------------
 1 | # Stack
 2 | 
 3 | A stack is a linear data structure that follows the Last In, First Out (LIFO) principle. 
 4 | 
 5 | The main operations on a stack are:
 6 | 
 7 | **Push:** Adds an element to the top of the stack.
 8 | 
 9 | **Pop:** Removes and returns the element from the top of the stack.
10 | 
11 | **Peek/Top:** Returns the element at the top of the stack without removing it.
12 | 
13 | **isEmpty:** Checks if the stack is empty.
14 | 


--------------------------------------------------------------------------------
/stack-using-array2.zip:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/DharshiniB04/Stack-Data-Structures/26d933d1084614fc20867e3f32b01ee9ae6a7090/stack-using-array2.zip


--------------------------------------------------------------------------------
/stack-using-linked-list2.zip:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/DharshiniB04/Stack-Data-Structures/26d933d1084614fc20867e3f32b01ee9ae6a7090/stack-using-linked-list2.zip


--------------------------------------------------------------------------------
/stack.zip:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/DharshiniB04/Stack-Data-Structures/26d933d1084614fc20867e3f32b01ee9ae6a7090/stack.zip


--------------------------------------------------------------------------------