In Assignment 3, you designed, coded, and tested a BST-implementation of the dynamic dictionary class, using the cursor implementation of trees. In this assignment, you are to design, code, and test an AVL implementation of the dynamic dictionary class, using the cursor implementation of trees, and implementing deletion using the strategy of lazy-deletion.

Sorting. Using your dynamic dictionary, write a utility that reads in a file of floating-point numbers specified as a command-line argument, and prints out (on standard output) the sorted file.

The following rules will be strictly enforced:

• Do not submit programs that will not compile. Explicitly state, as part of your honor pledge, how close your program comes to achieving the goals.
• Failure to sign the pledge will result in no points being awarded.

• Submissions will not be accepted after 10 minutes have elapsed from the start of class – no late submissions will be accepted without documented reasons.

• You are not permitted to work in groups – all your work must be your own, and you must attest to this in a signed pledge– failure to do so results in your program not being graded.

• Include a complete listing of all your code, input files, and output files
• Your code must be appropriately commented --- if we don’t understand your code with reasonable effort, you get no credit for it.
• Include a test plan detailing how you tested your program, and why you believe it is correct. (Note that the word-counting utility does not test your deletion routines – these must be tested separately!!)

• Include a (neatly typed – not handwritten) design plan and some general comments on the structure and layout of your assignment.

All of the above should be placed in an envelope with your name on the outside, and submitted at the beginning of class on the due date. Submissions will not be accepted after 10 minutes have elapsed from the start of class – no late submissions will be accepted without documented reasons.