Recall that one application of a Stack is to process an arithmetic expression written in postfix notation. We can also represent arithmetic expressions as a tree. Your job is to write a function that will convert a Stack
of singleton expression nodes (where all the left and right pointers are initially set to NULL) into the correct
tree structure. Note that you do not need to actually calculate the “answer” to the arithmetic expression.
Here is an example: