Java Stack Tutorial 🎯

Welcome to our comprehensive guide on the Java Stack! In this lesson, we'll explore the Java Stack, its importance, and how to effectively use it. Let's dive in! 📝

What is a Java Stack? 💡

A Java Stack is a data structure that follows the Last In, First Out (LIFO) principle. It's like a pile of books where the last book added is the first one to be taken out.

Why Use a Java Stack? 📝

Implementing algorithms that require reversing data, such as postfix expression evaluation or backtracking.
Managing function calls and the call stack.

Creating a Java Stack 💡

Java provides a built-in class named Stack within the java.util package. Here's how to create a simple Stack:

java

import java.util.Stack;

public class Main {
    public static void main(String[] args) {
        Stack<Integer> myStack = new Stack<>();
    }
}

📝 Note: Replace Integer with any data type you'd like to store in your stack.

Basic Stack Operations 💡

Push: Adds an element to the top of the stack.

java

myStack.push(1);
myStack.push(2);
myStack.push(3);

Pop: Removes and returns the top element from the stack.

java

int topElement = myStack.pop(); // 3, then 2, then 1

Peek: Returns the top element without removing it.

java

int topElement = myStack.peek(); // 3, then 2, then 1

Size: Returns the number of elements in the stack.

java

int stackSize = myStack.size(); // 3, then 2, then 1

Empty: Checks if the stack is empty.

java

boolean isEmpty = myStack.isEmpty(); // false, then false, then true

Advanced Stack Usage 💡

Let's demonstrate the power of a Java Stack with a real-world example: Postfix Expression Evaluation. Postfix expressions are useful in calculating mathematical expressions efficiently.

java

import java.util.Stack;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("Enter a postfix expression: ");
        String expression = scanner.nextLine();
        calculatePostfix(expression);
    }

    public static int calculatePostfix(String expression) {
        Stack<Integer> stack = new Stack<>();
        String[] tokens = expression.split("\\s");

        for (String token : tokens) {
            if (token.matches("[0-9]+")) {
                stack.push(Integer.parseInt(token));
            } else if (token.equals("+")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a + b);
            } else if (token.equals("-")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a - b);
            } else if (token.equals("*")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a * b);
            } else if (token.equals("/")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a / b);
            }
        }

        return stack.peek();
    }
}

With this in-depth tutorial, you've learned about the Java Stack, its applications, and how to use it effectively. Start building your projects and see the power of this essential data structure! 🚀