How Stack Works

Stack: A data structure that follows the LIFO (Last In, First Out) principle. This means the last item added is the first one to be removed.

• push(value) - Add a new item to the Stack.
• pop() - Remove the last added item.
• peek() - View the last item without removing it.
• print() - Display all items.
• max() - Show the maximum value.
• min() - Show the minimum value.
• sum() - Calculate the sum of all values.
• average() - Calculate the average value.
• count() - Show the number of items.
• swap(a, b) - Swap two items if they exist.
• reverse() - Reverse the order of items.
• sort() - Sort items in ascending order.
• clear() - Remove all items from the Stack.