Can you list the limitations inherent to the stack data structure?

A stack is a data structure with restrictions that define its behavior:

• Access only to the top element: you can only add (push) or remove (pop) the last added element.
• LIFO principle (Last In, First Out): the last added element will be the first to be retrieved.
• Limited access to elements: you cannot arbitrarily access elements inside the stack, only the top.
• Size restriction: depending on the implementation, a stack may have a fixed size (for example, an array-based stack), which limits the number of elements.

These restrictions make the stack suitable for tasks where the order of data processing is important, such as function calls, graph traversal, or undo actions.