The lectures this week describes how implement trees. All three lectures are contained in the single file.

The tutorial contains questions on the implementation and use of trees.

This week, you will working to implement queue algorithms. The stories for this week are in the Stack Backlog. Next week, you will begin working on a new backlog. This week, you will also demonstrate the parsing and evaluation of expression programs that you implemented last week.

This is the backlog for the material covered in lecture this week.

You will be demoing the stories from this backlog this week.