Computer Science 385
Analysis of Algorithms

Spring 2011, Siena College

Lecture 16: Guest Lecture: String Matching
Date: Thursday, March 10, 2011

Agenda

Lecture Assignment 16

Due at the start of class, Tuesday, March 22.

You need not submit answers to these questions, but you will have a chance to ask questions about them at the start of class.

  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.