Computer Science 210

Data Structures

Fall 2017, Siena College

Agenda

- Announcements
- Exam 3 information
- Exam during labs on Wednesday
- Practice exam 3 solutions available
- Planning a review session tomorrow, 6:30-8:00, Roger Bacon 328

- Lecture 29 assignment recap
- Programming Project 5: Best Of introduction
- Balanced Search Trees
- AVL Trees

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

Please submit answers to these
questions by the start of class. zyBook activities should be done
right in your zyBook, and all others should be submitted to
Blackboard under "Lecture 30 Assignment" . We will
discuss these questions at the start of class, so no late
submissions can be accepted.
* *

Read and complete the participation activities in your zyBook, Section 16.11. This is worth 5 points.

Also answer these questions:

- 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. (4 points)
- Now, starting with the original tree, insert 32 then 31. Show any rotations needed to maintain the AVL condition. (4 points)

Terminology

- AVL trees/AVL condition/single rotation/double rotation