CSC403: Homework [1/2]

• Read Algorithms 3.3 on balanced search trees.

• Read Algorithms 3.5 on hash tables.

• Written Homework - due before Sunday night at 11:59pm

  You should do the following problems on paper. The problems are all quite easy, and will give you practice with balanced trees. You will hand in your answers in on d2l in the folder labeled hw4a - Balanced Tree Problems. Make sure you submit to the correct folder! You must submit a word, pdf or text file. You can write out your answers on paper and hand in a scan. If you hand in a text file, be sure to used a fixed-width font like Courier.

        2-3 Trees:

          3.3.1
          3.3.2
          3.3.3
          3.3.5 --- structurally different means that they are different even
                    if all you ignore the values (take all values to be equal)
                    and you also ignore the order of the children  

        Red-Black Trees:

          3.3.9
          3.3.10
          3.3.11
          3.3.14
          3.3.15

• Programming Homework - due Wednesday at 5:45pm

  Complete the class algs32.KdTree. You can see instructions for a similar assignment here.

  Hand in KdTree.java on d2l. It goes in folder hw4b - Kd Tree. Make sure you submit to the correct folder!

  Do not rename or otherwise change any of the interfaces. I will grade it using the Point2D and RectHV classes that you are given.