+0 -0
A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle, meaning that the last element added to the stack is the first one to be removed.
Stacks are used for various purposes, such as managing function calls in a program, undo/redo operations in text editors, and evaluating expressions in a programming language. Stack operations include push (adding an element to the top of the stack), pop (removing the element from the top of the stack), and peek (accessing the top element without removing it).
Stacks can be implemented using arrays or linked lists, depending on the specific requirements of the use case.