Thank you!! They're not used in a lot of real-world applications -- although you could use them for in memory stores / log-structured merged trees / other data store applications. For the most part - AVL and Red-Black trees are great for teaching new students about self-balancing binary search trees (BSTs). If you do need to implement a BST - Red-Black trees are favored in applications where there is high-write throughput while AVL trees are better for read-heavy apps.
Great article. What are some use cases that AVL trees are especially good for?
Thank you!! They're not used in a lot of real-world applications -- although you could use them for in memory stores / log-structured merged trees / other data store applications. For the most part - AVL and Red-Black trees are great for teaching new students about self-balancing binary search trees (BSTs). If you do need to implement a BST - Red-Black trees are favored in applications where there is high-write throughput while AVL trees are better for read-heavy apps.