flash

Stack

A linear data structure where insertions and deletions are done at one end called the top end, following LIFO or FILO order.

push()

Operation to insert an element into the stack.

pop()

Operation to remove an element from the stack.

peek()

Operation to get the top data element of the stack without removing it.

isFull()

Operation to check if the stack is full.

isEmpty()

Operation to check if the stack is empty.

Array method

One way to implement a stack using arrays.

Linked list method

Another way to implement a stack using linked lists.

Applications of Stack

Various uses like recursion, undo/redo operations, page-visited history, string reversal, and parenthesis checking.

Expression Conversion

Converting expressions between prefix, postfix, and infix notations using stacks.

Expression Evaluation

Using stacks to evaluate prefix, postfix, and infix expressions.

Backtracking

A recursive algorithm for solving optimization problems like game playing or finding paths.

Memory Management

Stack's role in memory management within the Operating System.