Question: Which data structure would you use to implement a function that checks for balanced parentheses in an expression?
Options:
Correct Answer: Stack
Solution:
A stack is the ideal data structure for checking balanced parentheses, as it allows for the last opened parenthesis to be matched with the next closing parenthesis.