Data-structures for sets
Osnova sekce
-
-
Studenti musíOznačit jako hotovo
Contains binary search trees (BST) and introduction to AVL trees (definition and proof that they have logarithmic height)
-
-
-
-
-
-
-
-
-
-
Studenti musíOznačit jako hotovo
This quiz is voluntary - you can try how well you understand the topic and I get some feedback.
Please enrol the course so you can take it (even if you will not want the final mark from me).
You will be rewarded by a cool animation! -
Studenti musíOznačit jako hotovo
Second small quiz from you to test understanding of the class
-
-
-
-
-