AVL Trees

16 Feb
Friday, 02/16/2018 10:10am to 11:00am
Computer Science Building, Room 151
Speaker: Adam Blank

Abstract of sample lecture: This sample class is for a data structures class in Java. The course has already covered runtime analysis, binary trees, and binary search trees. We will discuss AVL Trees--the first type of balanced search tree students will have seen.  The sample lecture is the first 45 minutes of 70 minutes of lecture on this topic in the course.

Reception for attendees at 9:40 a.m. in CS 150

Faculty Host