Recorded lecture (same as for previous topic)
Abschlussbedingungen
Contains binary search trees (BST) and introduction to AVL trees (definition and proof that they have logarithmic height)
Klicken Sie auf 'Recorded lecture (same as for previous topic)', um die Ressource zu öffnen