Reading material

If you use the first edition of the textbook, follow the reading material in orange. If you use the second edition, follow the reading material in brown.

(1st) pages 260-265 (Section 7.3-7.4)

(2nd) pages 388-393 (Section 9.1-9.2)

Additional material

Implementation of a dictionary with a binary search tree in pseudocode: PostScript and PDF

Java code will be added soon.


Draw an AVL tree of height 4 having as few nodes as possible.