Lecture 149:-Stack Class - 1

Sure, let's start by creating a basic implementation of a stack class in C++. A stack is a linear data structure that follows the Last In First Out (LIFO) principle, where elements are added and removed from the top.

Here's a simple implementation of a stack class using an array:

cppCopy code

#include <iostream> class Stack { private: static const int MAX_SIZE = 100; // Maximum size of the stack int arr[MAX_SIZE]; // Array to store stack elements int top; // Index of the top element public: Stack() : top(-1) {} bool isEmpty() { return top == -1; } bool isFull() { return top == MAX_SIZE - 1; } void push(int value) { if (isFull()) { std::cout << "Stack is full. Cannot push " << value << std::endl; return; } arr[++top] = value; } int pop() { if (isEmpty()) { std::cout << "Stack is empty." << std::endl; return -1; // Return a special value to indicate underflow } return arr[top--]; } int peek() { if (isEmpty()) { std::cout << "Stack is empty." << std::endl; return -1; // Return a special value to indicate underflow } return arr[top]; } }; int main() { Stack stack; stack.push(10); stack.push(20); stack.push(30); 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; }

This implementation provides the basic functionalities of a stack: push, pop, and peek. It also includes methods to check whether the stack is empty or full. In this example, the stack has a maximum size of 100 elements, but you can adjust this value as needed.

You can extend this basic implementation by adding error handling, dynamic resizing, and other features depending on your requirements.