Mastering node-based binary trees with a focus on search, insertion, deletion, and balancing techniques like AVL and Red-Black Trees.
Implementing the fundamental operations of a Binary Search Tree.
Understanding self-balancing BSTs with a strict balance factor using rotations.
Exploring another self-balancing BST that uses node coloring to ensure balance.