English

An algorithm is implemented to find if a sequence of parentheses in ((()(())(())) is balanced. What would be the max number of parentheses that can appear on the stack at any one time? -

Advertisements
Advertisements

Question

An algorithm is implemented to find if a sequence of parentheses in ((()(())(())) is balanced. What would be the max number of parentheses that can appear on the stack at any one time?

Options

  • 0

  • 1

  • 2

  • 3

MCQ

Solution

3

shaalaa.com
Conversion from Infix to Postfix Notation
  Is there an error in this question or solution?
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×