मराठी

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
Advertisements

उत्तर

3

shaalaa.com
Conversion from Infix to Postfix Notation
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×