Conclusion
Today's exercises ended with a quintessential application of tree building: construction of an arithmetic expression tree. Variations of this code have appeared on exams, projects, and homework in past versions of CS 61BL. If you're comfortable with the code, you're in good shape for every other recursive program in this course.
Homework Submission
- You will turn in your
BinaryTree.java
file as hw12.
Reading Assignment
- JRS: Binary Search Trees
- CIDS: Chapter 9