Lecture notes for Week 8:

1. Trees

2. Binary Search Trees

Textbook portions covered

Introduction to Algorithms (Cormen et al.)

Chapter 12, Appendix B.5

Engineering Algorithms...(Clowes “online book”)

Chapter 7

Midterm

Lecture 23/24 (Tuesday, March 8, 2005)

Announcements

• Midterms returned next week.

Topics

• Tree definitions.
• Ordered vs. unordered
• Binary Trees
• Traversals
• Algorithms: Find, Add, Delete, Min, Max, Predecessor, Successor

Suggested Problems

Introduction to Algorithms (Cormen et al.)

Engineering Algorithms...(Clowes “online book”)