1. raw binary search trees of height 2 and 6, respectively, on the set of keys {1, 2, 3, 4, 5, 6,7}. (20%)