Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))?
A. 1
B. 2
C. 3
D. 4 or more
Answer: Option C
This Question Belongs to Data Structure >> Introduction To Data Structures
Join The Discussion