Using pseudo-code or C code, write an algorithm to recursively print out the values of the nodes in a pointer-based implementation of a binary tree, using an in-order traversal strategy. Implement the function such that it produces a parenthesised mathematical expression. For example, the output expression that the function would produce in the case of the expression tree shown above should be: (((a))+(b))*(((c)-(1))/((d)+(1))) Include in your answer a pseudo-code or C definition of the data structure.

An expression tree is a tree used to represent mathematical expressions. It is such that the leaves contain the operands (e.g. constants and variables) and the remaining nodes contain the operators (e.g. addition, multiplication, square root). (i) b Showing your workings write the resulting expressions when printing out the values of the nodes using the following traversat strategies: a. pre order (NLR), [10%) b. post-order (LRN). [10%) Using pseudo-code or C code, write an algorithm to recursively print out the values of the nodes in a pointer-based implementation of a binary tree, using an in-order traversal strategy. Implement the function such that it produces a parenthesised mathematical expression. For example, the output expression that the function would produce in the case of the expression tree shown above should be: ((/(a))+(b))*((0)-(1))/((d)+(1))) Include in your answer a pseudo-code or C definition of the data structure. [20%]