The first lecture this week describes binary search trees. A technique for speeding up search using binary trees.

The second lecture this week describes threaded binary trees. A technique for speeding up traversals.

The third lecture this week describes AVL-trees. A technique for maintaining balanced binary trees.

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

This week you will continue working in the Tree Backlog. You will implement binary search trees and demo the complete binary trees you wrote last week.

This is the backlog for the rest of the class. You will start implementing from this backlog this week.