CSC 2200 

Fall 2002


Up

Homework #2 (project)

Due on October 31, 2002 @ 6:00 pm

1.     Show the result of inserting values I, A, D, S, V, T, B, E, P, R, M, K into an initially empty binary search tree. Then show all intermediate results of deleting nodes with values S, P, A, M, D, T, I from that tree.

2.     Show all intermediate results of inserting values I, A, D, S, V, T, B, E, P, R, M, K into an initially empty AVL tree. Then show all intermediate results of deleting nodes with values S, P, A, M, D, T, I from that tree.

3.     Show all intermediate results of inserting values 2, 1, 4, 5, 8, 3, 6, 7 into an initially empty AVL tree. Then show all intermediate results of deleting nodes with values 1, 2, 3, 4, 5, 6, 7, 8 from that tree.

4.     Build the Huffman coding tree and determine the codes for the following set of letters and weights:

a)

b)

For problems or questions regarding this web contact besta@cs.wayne.edu.
Last updated: September 09, 2002.