What is a stack frame?

The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty, and a method to search the stack for an item and discover how far it is from the top.

When a stack is first created, it contains no items.

Methods:

• empty() - Returns boolean - Used to check if the stack is empty
• peek() - Returns Object - Take a look at the top most element in the stack without popping it
• Pop() - Returns Object - Returns the top most element from the stack
• push(Object o) - Pushes the object at the top of the stack
• search(Object o) - Returns int - Returns the index location of the searched object. Returns -1 if the object is not found.

Stack is a data structure it allows data to be inserted and removed in a push and a pop operation . stack also support a peek operation which reads data without removing it. A stack is a LIFO-queue, meaning that the last data to be inserted will be the first data to be removed