The data structure required to check whether an expression contains a balanced…

To check balanced parentheses, scan the expression from left to right. Push every opening parenthesis onto a stack. For each closing parenthesis, pop the most recent opening parenthesis and check that it matches. This last-in-first-out behavior is exactly what a stack provides, so the required data structure is a stack.