How to optimize your Binary Search Tree
Anthony Watson gives an introduction to what self-balancing Binary Search trees are, why they're useful and necessary, and some different permutations. Red-Black and AVL Trees, in particular, assume the lead roles for this talk. Anthony delves into their individual characteristics, common use cases and a comparison of the two.
Project Members: Anthony Watson