Recorded lecture (same as for previous topic)
Požadavky na absolvování
Contains binary search trees (BST) and introduction to AVL trees (definition and proof that they have logarithmic height)
Kliknutím na Recorded lecture (same as for previous topic) otevřete zdroj.