Question

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: (()(())(())) are:
1
2.
3
4 or more​

Answer 1

Answer:

A right parenthesis makes pop operation to delete the elements in stack till we get left parenthesis as top most element. 3 elements are there in stack before right parentheses comes. Therefore, maximum number of elements in stack at run time is 3.

Explanation:

PLease FOund ME AND FOllow Me