Computer Science 385
Design and Analysis of Algorithms
Spring 2025, Siena College
Lecture 21: D&C Closest Pair Wrapup; AVL Trees
Date: Friday, March 21, 2025
Agenda
- Announcements
- Problem Set 3: [PDF] submission updates welcome now
- Empirical Study 1: [PDF] late clock getting late
- Academic Showcase Project: group formation should be wrappng up and topic
selection underway
- Lab 6: Recurrences and Divide and
Conquer, get remaining items checked by the start
of your lab next week
- Exam 2 will take place during lab meetings on April 1 -
details coming Monday
- Problem Set 4: [PDF] is underway: be sure to watch the brief
video intro linked in Canvas
- Continuing the In-class Lab Activity: Divide and Conquer
Closest Pair algorithm
- Consistently arriving late to class and lab is unacceptable
- Balanced Search Trees
Terminology
- balanced trees
- balance condition
- red-black trees
- AVL trees
- splay trees
- 2-3 trees
- AVL condition
- single rotation
- double rotation