Georgia Institute of Technology,GTx
Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms (edX)
Expand your knowledge of complex tree data structures with this course on AVL and (2-4) trees. Learn how to balance these intricate structures and implement effective operations. Delve into the world of Divide and Conquer algorithms, starting from simple iterative sorts and progressing to more sophisticated techniques that enhance efficiency in sorting tasks.