38: Balanced Trees - Richard Buckland UNSW

preview_player
Показать описание
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.
Рекомендации по теме
Комментарии
Автор

This is the best lecture I've heard in a very long time. Thank you very much for these.

kprasad
Автор

I just want to thank him, he's fantastic in his way.

MrThe
Автор

This...lecturer...is freaking..awesome...

mapk
Автор

That description of the game mediocre made my day

DylanGriffith
Автор

lol at the american version ".. where whoever picks the biggest number will win and leading to the quickly global domination"

shairuno
Автор

found the lecture's structure confusing and the lecturer befuddled in places

treaps
Автор

I can't stop laughing, oh my gosh:  Mediocre - only the average wins...! Yeah! Boo!  Boyeah! 

ThuyNguyen-buge