This preview shows page 1. Sign up to view the full content.
Unformatted text preview: tree unique? If yes, prove it. Otherwise, give a small counterexample. 2. Problem 4.19 on page 177. At every insertion, give the resulting intermediate tree, the lowest complaining (unbalanced) node and the type of rotation, single left (Fig. 4.48), double left (Fig. 4.47), single right (mirror of Fig. 4.48), double right (mirror of Fig. 4.47), if they are applicable. 3. Problem 4.25 on page 177. 4. Problem 4.27 on page 177. For every access, give the resulting intermediate tree after the access. 5. Problem 4.28 on page 177. Show the tree intermediate trees: after splaying at 6, after splaying the largest key less than 6 to the left child of the root, and the final tree....
View
Full
Document
 Spring '08
 M.McCullen
 Algorithms, Data Structures

Click to edit the document details