हिंदी

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

प्रश्न

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?

विकल्प

  • 0

  • 1

  • 2

  • 3

MCQ

उत्तर

3

shaalaa.com
Conversion from Infix to Postfix Notation
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×