Faculty Candidate Seminar

AVL Trees

Adam Blank

University of Washington
Tuesday, March 06, 2018
10:30am - 11:30am
3725 Beyster

Add to Google Calendar
CSE Lecturer Candidate

About the Event

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 lecture on this topic in the course. This lecture is, in part, a "meta-lecture" that demonstrates an active style of teaching as well as a teaching philosophy by example. We discuss AVL Trees in the contexts of abstractions, algorithms, and proofs.


Adam Blank is currently a Lecturer in the Computer Science and Engineering Department at University of Washington. He received his M.S. from Carnegie Mellon in Spring 2014. He is interested in using technology, collaboration, experimentation, and active learning to help CS college students get as much as they can out of their education.

Additional Information

Sponsor(s): CSE

Open to: Public