Computer Science 211
Data Structures

Agenda

• Announcements
  • We will meet for a regular lecture on Friday to make up for Monday's missed class. Please be here at 8:35.
  • The last lab will come out on Friday (maybe sooner on the web) and will be due on the last day of classes.
• Delayed until next time: AVL Tree Wrapup
• Graphs
  • introduction and terminology
  • Graph interface
  • adjacency matrix and adjacency list implementations

Examples

• structure5.Graph* (all Graph-related structure package sources)

Lecture Assignment

Due at the start of class, Friday, December 4.

Turn in short answers to these questions. Please turn in a hard copy (typeset or handwritten are OK). We will discuss these problems during class, so no late submissions are accepted.

1. Start with a complete AVL tree containing the values 10, 20, 30, 40, 50, 60, and 70. Insert the values 31, then 32, showing any rotations needed to maintain the AVL condition.
2. Now, insert 32 then 31. Show any rotations needed to maintain the AVL condition.
3. Bailey Problem (not Self-Check) 16.2, p. 435.
4. Bailey Problem (not Self-Check) 16.6, p. 436.
5. Bailey Problem (not Self-Check) 16.10, p. 436.