Lists, trees and recursion

In these two lectures we will look at how to work with lists and tree structures. Since both are defined recursively it is natural to use recursion when defining functions over them. Recursively defined functions are very powerful in that they are easier to verify and analyse.

* recursion.pdf
* trees.pdf
Before this lecture you should have read chapter 2 and 3 in the course book (up to "runtime Errors") and also seen corresponding sections in the online material. You should also have done the following exercises.

* introduction.pdf
After the lecture Work with the first assignment and make sure that you can generate a nice report using the LaTex template.