The purpose of this homework is to give you a chance to focus your knowledge of storing and retrieving data in trees.
C++ Problem # | Java Problem # | Notes | Levels |
---|---|---|---|
8.7.1 | 8.7.1 | 0.5 | |
8.7.5 | 8.7.5 | 1 | |
8.7.6 | 8.7.6 | 1 | |
8.7.7 | 8.7.7 | 0.5 | |
8.7.10-12 | 8.7.10-12 | 0.5 | |
8.7.14 | 8.7.14 | 1 | |
8.7.15 | 8.7.15 | 2 | |
8.7.20,21 | 8.7.20,21 | 1 | |
8.7.22 | 8.7.22 | 0.5 | |
8.7.25 | 8.7.25 | 0.5 | |
8.7.27 | 8.7.27 | 1 | |
8.7.28 | 8.7.28 | 0.5 | |
8.7.29 | 8.7.29 | 0.5 | |
8.7.32 | 8.7.32 | 1 | |
8.7.38 | 8.7.41 | 1 | |
8.7.39 | 8.7.42 | 1 | |
8.7.40 | 8.7.43 | 0.5 | |
8.7.42 | 8.7.45 | hint: use a stack | 1 |
8.7.43,44 | 8.7.49,50 | C++ has a typo in 44 referring to preorder_draw instead of preorder_layout | 1.5 |
8.7.45 | 8.7.51 | 1 | |
8.7.46 | 8.7.52 | 0.5 | |
8.7.47 | 8.7.47 | 1 | |
8.7.48,50 | 8.7.54,56 | 1 | |
8.7.51 | 8.7.57 | 0.5 | |
8.7.53 | 8.7.59 | 0.5 |
Your target level for this assignment is (Level 5). Choose problems that add up to at least this amount from above.