Lecture 151:- Stack Class - 3 and 4

Certainly, let's continue building on the stack class and cover some additional features.

Stack Class - Version 3: Size and Capacity

In this version, we'll add methods to track the current size and capacity of the stack. This can be useful to know how many elements are in the stack and how much capacity is available.

cppCopy code

#include <iostream> class Node { public: int data; Node* next; Node(int value) : data(value), next(nullptr) {} }; class Stack { private: Node* top; // Pointer to the top of the stack int size; // Current size of the stack int capacity; // Maximum capacity of the stack public: Stack(int maxCapacity) : top(nullptr), size(0), capacity(maxCapacity) {} bool isEmpty() const { return size == 0; } bool isFull() const { return size == capacity; } int getSize() const { return size; } int getCapacity() const { return capacity; } void push(int value) { if (isFull()) { std::cout << "Stack is full. Cannot push " << value << std::endl; return; } Node* newNode = new Node(value); newNode->next = top; top = newNode; size++; } int pop() { if (isEmpty()) { std::cout << "Stack is empty." << std::endl; return -1; // Return a special value to indicate underflow } Node* temp = top; int poppedValue = temp->data; top = top->next; delete temp; size--; return poppedValue; } int peek() const { if (isEmpty()) { std::cout << "Stack is empty." << std::endl; return -1; // Return a special value to indicate underflow } return top->data; } ~Stack() { while (!isEmpty()) { pop(); } } }; int main() { Stack stack(5); // Initialize stack with a maximum capacity of 5 stack.push(10); stack.push(20); stack.push(30); std::cout << "Current size: " << stack.getSize() << std::endl; std::cout << "Max capacity: " << stack.getCapacity() << std::endl; std::cout << "Top element: " << stack.peek() << std::endl; std::cout << "Popping elements: "; while (!stack.isEmpty()) { std::cout << stack.pop() << " "; } std::cout << std::endl; return 0; }

In this version, we added methods to get the current size and maximum capacity of the stack (getSize and getCapacity). We also modified the constructor to accept the maximum capacity as a parameter.

Stack Class - Version 4: Error Handling with Exceptions

In this version, we'll enhance the error handling by using C++ exceptions to indicate underflow and overflow conditions.

cppCopy code

#include <iostream> #include <stdexcept> class Node { public: int data; Node* next; Node(int value) : data(value), next(nullptr) {} }; class Stack { private: Node* top; // Pointer to the top of the stack int size; // Current size of the stack int capacity; // Maximum capacity of the stack public: Stack(int maxCapacity) : top(nullptr), size(0), capacity(maxCapacity) {} bool isEmpty() const { return size == 0; } bool isFull() const { return size == capacity; } int getSize() const { return size; } int getCapacity() const { return capacity; } void push(int value) { if (isFull()) { throw std::overflow_error("Stack is full."); } Node* newNode = new Node(value); newNode->next = top; top = newNode; size++; } int pop() { if (isEmpty()) { throw std::underflow_error("Stack is empty."); } Node* temp = top; int poppedValue = temp->data; top = top->next; delete temp; size--; return poppedValue; } int peek() const { if (isEmpty()) { throw std::underflow_error("Stack is empty."); } return top->data; } ~Stack() { while (!isEmpty()) { pop(); } } }; int main() { Stack stack(5); // Initialize stack with a maximum capacity of 5 try { stack.push(10); stack.push(20); stack.push(30); std::cout << "Current size: " << stack.getSize() << std::endl; std::cout << "Max capacity: " << stack.getCapacity() << std::endl; std::cout << "Top element: " << stack.peek() << std::endl; std::cout << "Popping elements: "; while (!stack.isEmpty()) { std::cout << stack.pop() << " "; } std::cout << std::endl; // Attempt to pop from an