ECE $205$ Spring $2024$ Final Project

Due Date: May $13,2024$

The purpose of the final project is to create a program that will read in an infix expression, create a

binary tree that represents this expression, as a postfix expression and then evaluate the binary tee using

a stack.

The algorithm we are using to convert the infix expression to a binary tree requires only a single left$-$toright pass over the expression and several stacks used for different purposes.

The program reads an ordinary infix arithmetic expression with integers and operators separated by

blanks:

$(16+2)*528/4$

a$)$ does a postorder traversal of the binary tree and writes it out as a postfix expression:

$162+5*284/-$

b$)$ converts it into a binary tree:

$-$

$/\backslash$

$*/$

$/\backslash /\backslash$

$+5284$

$/\backslash$

$162$

c$)$ uses a stack to evaluate the binary tree expression

$83$

Test the program with several expressions.

Submit the project as all the homework assignments were submitted.