|
Computer Science 211 Data Structures Mount Holyoke College Fall 2009
|
|
Lecture 22: Tree Traversals
Date: Wednesday, November 4, 2009
- Announcements
- Friday: meet in our regular classroom at 9 for the next assignment.
- Next week: Luis von Ahn from Carnegie Mellon will speak on "Human Computation" at 7:30 PM, November 12.
- Looking ahead: exam 2 scheduled for Monday, November 16.
- Courses for next semester
- Lecture Assignment Recap
- Tree Traversals
- preorder, in-order, postorder and level-order
- recursive implementation
- implementations as Iterators
- BTTraversals
- structure5.BTPreorderIterator
- structure5.BTInorderIterator
- structure5.BTPostorderIterator
- structure5.BTLevelorderIterator
Due at the start of class, Monday, November 9.
Turn in short answers to these questions. Please turn in a hard
copy (typeset or handwritten are OK). We will discuss these problems
during class, so no late submissions are accepted.
- Bailey Problem 12.10, p. 311.
- Bailey Problem 12.20, p. 311.