CS 253  Homework # 3

Problem 1.

Write a program that takes an arithmetic expression in an infix 
form, converts it to a postfix form and then evaluates it (follow 
instructions given in class and lecture notes). Use linked lists 
for the infix and postfix queues and the operator and value stacks. 
You must use your own  Stack and Queue classes (my code is a good 
starting point). Submit the code + example runs to validate 
your code. Submit UML chart to show the program design. 

Problem 2.

Given the following postorder and inorder traversals of a binary 
tree, draw the tree:
   
   Postorder:  A   B   C   D   E   F   I   K   J   G   H

   Inorder:    C   B   A   E   D   F   H   I   G   K   J

Explain your answer in a systematic and recursive fashion.