Question

The data structure required to check whether an expression contains balanced parenthesis is

Answer 1

The answer is stack.

The data structure required to check whether an expression contains balanced parenthesis is a stack. This is a simple data structure in which elements can be added and removed in a specific order. In other words, it follows a LIFO or a FILO structure. There are three primary stack operations as given below:

*Push – Inserting items into a stack.

*Pop – Removing items from a stack.

*Pip – Displaying the contents of a stack.

Answer 2

Hello mate

here's your answer

___________________

The data structure required to check whether an expression contains balanced parenthesis is stack.

_______________

Thanks