Data Structures | Stack | Question 5

Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced:

   declare a character stack 
   while ( more input is available)
   {
      read a character
      if ( the character is a \'(\' ) 
         push it on the stack
      else if ( the character is a \')\' and the stack is not empty )
         pop a character off the stack
      else
         print \"unbalanced\" and exit
    }
    print \"balanced\"

Which of these unbalanced sequences does the above code think is balanced?

(A)

((())

(B)

())(()

(C)

(()()))

(D)

(()))()

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News