Homework 10

Details

Homework 10

Due March 14, 2006

Some problems are taken from Introduction to the Design and Analysis of Algorithms.

Your work should be clear, concise, and in the order given.No scratched-out work, etc. should be present on your assignment.Illegible or messy work may result in a reduction in points. It is recommended that you learn and use some computer typesetting software (e.g. Word or LaTeX).

Do problem 10a from Section 6.1 on page 199 of the textbook. (10 points)
Construct a 2-3 tree, a red-black tree, and a heap by inserting the following values into an empty data structure in the given order. Show enough intermediate steps to demonstrate what is happening. (10 points)
```
     5, 3, 17, 2, 20, 19, 15, 14, 13, 12, 11
```