java.util.Stack<E>

In Java, a stack is a data structure that follows the Last-In-First-Out (LIFO) principle, which means that the last element added to the stack will be the first one to be removed. It behaves like a collection of elements with two main operations: push, which adds an element to the top of the stack, and pop, which removes the topmost element from the stack. Additionally, a peek operation is often provided to look at the top element without removing it.

Java provides a built-in implementation of a stack through the java.util.Stack class, which extends the Vector class. However, it is generally recommended to use the more efficient java.util.ArrayDeque class as a stack, as Stack is a legacy class that has some design issues and is slower due to being synchronized.

Let's create Stack using LinkedList