Overview
This week we will begin exploring applications of binary trees. We'll begin with the first application presented in our text, expression trees.
Wednesday, April 17th and Friday, April 19th
Classwork / Homework
I will be away with our high school programming team at the High School Programming Contest on Friday, so we need to plan today for both today and Friday.
Let's pair up to work on program that will do each of the following:
- take a string containing an infix expression with numeric (not variable) operands as input and construct an expression tree from it.
- take an expression tree constructed above as input and evaluate it, returning its numeric value.
- take an expression tree constructed above as input and return strings containing the expression in Polish notation.