Today:
- Announcements
- Homework for section 5.3 returned:
- 8: Just do each case, and average over them.
- 10: minimum worst case: 4 (= floor(log(m))+1)
- 12: if you use the author's algorithm, you won't write the
nodes in alphabetic order; if you use the
"left/root/right" notion, you will. Whoops!;) I took
either answer, of course....
- Homeworks for sections 6.2 and 6.3 will be turned in with the exam.
- FYI: next exam is Wednesday, 11/17. The exam will go through 6.2 and 6.3.
- Last time we were working on section 6.3, on graph algorithms:
Let's wrap that up....
- Today we look at Section 6.4:
Links
Website maintained by Andy Long.
Comments appreciated.
