Recorded lecture (same as for previous topic)
Completion requirements
Contains binary search trees (BST) and introduction to AVL trees (definition and proof that they have logarithmic height)
Click on Recorded lecture (same as for previous topic) to open the resource.