Lecture 17

We finished the material in chapter 13 (trees). In particular, we saw two examples of using a recursion tree to find a closed form. And then we looked at the "rank" of a binary tree and sketched the induction proof of a claim about rank. (Rank won't be on an exam. It's just an example of an inductive definition.)

Announcements

• The second midterm is Tuesday the 29th (in class).
• Pre-exam office hours are posted on piazza, including a review sessions Sunday 5-7pm in 2405 Siebel.
• Exam review materials are posted on the Exams web page, with two optional activities on moodle.
• Go to sleep at a reasonable hour Monday night: math exams aren't kind to sleepy brains.