CS 253  Homework # 3

Problem 1.

Write a program that takes an arithmetic expression is a 
postfix form and then evaluates it (follow instructions
given in class and lecture notes). Use linked lists for 
the postfix queue and the value stack. You must create your 
own  Stack and Queue class (you may want to use my code to 
start with). Submit the code + example runs to validate your 
code.

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.