CS2: Data Structures and Algorithms - Richard Buckland - 38: Balanced Trees - Richard Buckland UNSW

5.0 (4)

32 learners

What you'll learn

This course includes

32.3 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

Balanced Trees Balancing Trees Self balancing Trees Heaps Heapsort Australian Mediocre Mediocrity Richard Buckland UNSW

Full Transcript

Approaches to Balancing Trees. Rotations, Splay Trees. Treaps. Heaps. Types of heaps, representing heaps. Operations on heaps. Lecture 38 of Computing2 (Comp1927) "Data Structures and Algorithms" by Richard Buckland, UNSW Australia. This class was recorded in September 2009.