How to look at top of a stack Java?

How to Look at Top of a Stack in Java

Overview

In Java, stacks are fundamental data structures that allow for efficient addition and removal of elements from both ends. When it comes to looking at the top element of a stack, there are several approaches you can take. In this article, we’ll explore the different ways to access the top element of a stack.

Method 1: Using the Peek() Method

The peek() method is a built-in method in Java that allows you to retrieve the top element of a stack without removing it. It returns the top element, but it does not add it to the stack.

Stack stack = new Stack();

stack.push(1);

stack.push(2);

stack.push(3);



// Access the top element using peek()

System.out.println(stack.peek());  // Output: 3

Method 2: Using the remove() Method

The remove() method is a basic operation in Java that removes and returns the top element of a stack. However, it modifies the stack, so we need to make a copy of the original stack before calling remove() on it.

Stack stack = new Stack();

stack.push(1);

stack.push(2);

stack.push(3);



// Create a copy of the stack

Stack stackCopy = new Stack();



// Remove the top element from the original stack and add it to the copy

stackCopy.push(stack.pop());



// Now we can safely call remove() on the copy

System.out.println(stackCopy.pop());  // Output: 1

Method 3: Using recursion

Another way to look at the top element of a stack is by using recursion. This method is useful when you need to iterate over the elements of the stack or perform some other operation on the top element.

Stack stack = new Stack();

stack.push(1);

stack.push(2);

stack.push(3);



// Define a recursive function to get the top element

public int getTopElement() {

    if (stack.isEmpty()) {

        return -1; // or throw an exception

    } else {

        return stack.pop();

    }

}



// Call the recursive function

System.out.println(getTopElement());  // Output: 3

Important Notes

• The above methods do not add the top element to the stack. If you need to add elements to the stack, you should create a new stack and use the push() method.
• The methods above do not preserve the original order of elements. If you need to keep the original order of elements, you should use a stack implementation that preserves order, such as a LinkedStack or a PriorityQueue.
• The remove() method can modify the stack. If you need to preserve the original order of elements and cannot modify the stack, you should use the peek() method instead.

Table of Contents

1. Overview
2. Method 1: Using the Peek() Method
3. Method 2: Using the remove() Method
4. Method 3: Using recursion
5. Important Notes

In conclusion, there are several ways to look at the top element of a stack in Java. The peek() method is a simple and efficient way to access the top element without modifying the stack. However, the remove() method and the recursive approach may not be suitable for all use cases.