Question

Paranthesis matching can be implemented using the data structure​

Answer 1

Answer:

A matching pair means, there should be a closing parenthesis for an opening one, in correct order. ... For example : '((()))' , function should return TRUE , but ')(())' will return FALSE .

This is a clue that stacks can be used to solve the problem. Once you agree that a stack is the appropriate data structure for keeping the parentheses, the statement of the algorithm is straightforward. ... As long as it is possible to pop the stack to match every closing symbol, the parentheses remain balanced

Answer 2

is it okay for you

hope it's help helpful