Summaries
- Class #01 (10/02/2020):
Introduction to the course: functioning, evaluation, motivation and syllabus; motivation for dynamic set data structures; binary search tree concepts and basic algorithms for searching, inserting and removing (with visualization); balance in search trees; simple rebalancing schemes: reconstruction of the tree; basic tree operations: rotations; AVL trees and their invariant.
- Class #02 (12/02/2020):
AVL trees: search, insert and remove operations (with visualization), proof of logarithmic height, advantages and disadvantages; Red-Black Trees: motivation and origins, invariants, proof of logarithmic height, insert operation (with visualization), advantages and disadvantages; set, multiset, map and multimap in typical programming languages.
- (...)