A is a fundamental data structure that follows the Last-In-First-Out (LIFO) principle. In this structure, elements are added and removed from the same end, which is commonly referred to as the top of the stack. The stack operations that manipulate the elements include , , and .
