No solutions will be posted.
We will solve a subset of the following problems in the lecture on December 8
NOTE: As you may have noticed, we used a lot of examples and diagrams in the lectures. So email is not an
effective method to answer questions related to course material. Please DO NOT ask how to solve the
following problems via EMAIL. Attend the lecture on December 8 and come to the office hours.
Exercises from Textbook
: C-7.3, C-7.4, C-7.21, C-7.24, C-7.31.
Note: Solve C-7.4 first then C-7.31. You may assume binary trees for these 2 problems to simplify the code.
BSTs, AVL Trees
: R-10.1, R-10.4, R-10.7, R-10.9, R-10.10, R-10.11, C-10.1.
: C-8.14, C-8.17.
: R-9.5, R-9.6, R-9.7, R-9.8, R-9.12.
: R-13.2, R-13.8, R-13.9, R-13.10.
1. Given the keys 1, 2, .
.., 14, and 15, show a sequence of insertions that results in
a. a nicely balanced binary search tree.
b. a very unbalanced BST.