Stack Data Structure Overview

Study Notes

A stack is a linear data structure that stores elements in a specific order, following the Last-In, First-Out (LIFO) principle.
Insertion and deletion of elements are allowed only at the top of the stack.
Stacks can be implemented using various data structures like arrays, linked lists.

Register Stack: Uses CPU registers for storage, offering fast access but limited size.
Memory Stack: Uses main memory (RAM), enabling larger stack size but with slower access speeds.

IsEmpty: Checks if the stack is empty.
IsFull: Checks if the stack has reached its maximum capacity.
Top: Points to the most recently added element in the stack.
Size: The maximum number of elements the stack can hold.
Underflow: Error that occurs when attempting to remove an element from an empty stack.
Overflow: Error that occurs when attempting to add an element to a full stack.
Null: Represents an empty stack.
Max-1: Represents a full stack.

Function Call Stack: Used to manage function calls by storing information like local variables, parameters, and return addresses.
The call stack works based on the LIFO principle:
- When a function is called, its frame is pushed onto the stack.
- When a function returns, its frame is popped off the stack.
This allows for efficient function execution and handling of nested function calls.