Scenario.

You are assigned with the task of creating a list data structure implemented using pointers that will read

the inputs from the user, where

You may choose to use any one of the following for your assignment,

One$-$Way linked list

Two $-$Way linked list

One$-$Way circular linked list

Two$-$Way circular linked list

First node will have the count of the number of nodes available in the linked list $($excluding the

first node$),$ initially the linked list will have $1$ node with value $"0"$ indicating zero nodes.

The linked list will contain a mathematical expression given by the user during run$-$time.

Your program must do the following

Check the input expression for Brackets$/$Parenthesis checking.

When the Brackets$/$Parenthesis checking is validated then convert the expression to its

equivalent post$-$fix expression.

Replace the given input linked list with the postfix linked list while maintaining the node

count $($first node$)$

Given Linked List $($input$)$

Infix $-(x^{{?}^{{?}^{?}}}Y)+9$

Output Linked List $($output$)$

Postfix $-$ X $Y^{{?}^{{?}^{?}}}9+$Scenario.

You are assigned with the task of creating a list data structure implemented using pointers that will read

the inputs from the user, where

You may choose to use any one of the following for your assignment,

One$-$Way linked list

Two $-$Way linked list

One$-$Way circular linked list

Two$-$Way circular linked list

First node will have the count of the number of nodes available in the linked list $($excluding the

first node$),$ initially the linked list will have $1$ node with value $"0"$ indicating zero nodes.

The linked list will contain a mathematical expression given by the user during run$-$time.

Your program must do the following

Check the input expression for Brackets$/$Parenthesis checking.

When the Brackets$/$Parenthesis checking is validated then convert the expression to its

equivalent post$-$fix expression.

Replace the given input linked list with the postfix linked list while maintaining the node

count $($first node$)$

Given Linked List $($input$)$

Infix $-(x^{{?}^{{?}^{?}}}Y)+9$

Output Linked List $($output$)$

Postfix $-$ X $Y^{{?}^{{?}^{?}}}9+$