CSCI 2720			Data Structures			     Spring 2004

			  Homework Assignment #3


Due at the start of class on Thursday March 4.

Be sure to explain your answers when asked to do so.

All problems except for T (below) are from Ch. 4, 6, or 5 of the text by Lewis
and Denenberg, as modified by the special directions given in three cases.
Each problem or part is worth 10 points.

Ch. 4: 12, 14, 28

Ch. 6: 34, 36*, 39*

Ch. 5: 32*, 34(a), 34(b)

* Special directions below:

6.36 Just do the problem without considering how to deal with the key sequence
     in left to right order.  Thus, it's okay to read it from right to left if
     that is more convenient than right to left.

6.39 Give the entire remove algorithm in C++.  Use Tnode** as for Project #2.
     You may assume that the inorder successor is always chosen in the 2 child 
     case, as in the text.

5.32 Assume that the code dictionary will hold up to 100 entries, for the two
     digit decimal codes 00-99.  Also, start the dictionary with only the
     characters which appear in the poem: a,b,c,d,r,comma, blank, and !, 
     having codes 00,...,07 in that order, and treat those 8 characters as
     the whole alphabet.

T  Devise a modification to Algorithm 4.9 (p. 122) which finds the inorder 
   successor in a threaded binary search tree without being able to test a RC or
   LC pointer to see if it is a thread.  Your modification should only follow
   one more pointer than Alg. 4.9 would do in the same situation.  Explain
   why your modification works, and why it only ever follows one more pointer
   than Alg. 4.9 would.