When you're dealing with data structures like trees, the balance of its "leaves" (data/nodes) matters. The moment a tree becomes unbalanced, it loses its efficiency, much like a real life tree bending to the weight of one side, unable to efficiently stand tall and grab the light of the sun. Don't let your garden grow full of lopsided saplings, and make sure to plant some AVL trees--your efficient runtime hangs in the balance. Based on Vaidehi Joshi's blog post, "The Little AVL Tree That Could".
We're on Patreon!
If you like the show and want to support our work, become a patron here. You'll get stickers, postcards, and even socks. Let's make computer science more accessible and fun!
Vaidehi Joshi (co-host)
Vaidehi is a writer and an engineer at Tilde, where she works on Skylight. She's the creator of basecs, a weekly writing series that explores the fundamentals of computer science.
Saron Yitbarek (co-host)
Saron is a developer, podcaster, founder of CodeNewbie, and host of the CodeNewbie Podcast.
CodeNewbie
CodeNewbie is the most supportive community of programmers and people learning to code. They produce the CodeNewbie Podcast and the annual Codeland conference. Follow them on twitter @CodeNewbies. For more info, checkout www.codenewbie.org