Manage episode 239030146 series 1714497
Last episode, we learned about AVL trees, a type of self-balancing binary search tree that follows a golden rule: no single leaf in the tree should have a significantly longer path from the root node than any other leaf on the tree. In this episode, we learn about a pattern that we can use to programmatically figure out the minimum number of nodes we’ll need to create any given height-balanced AVL tree, which leads us to the Fibonacci sequence, and relates to the "golden ratio" you might know about from fine art! Trust us, this is really neat stuff. Based on Vaidehi Joshi's blog post, "Finding Fibonacci In Golden Trees".
A huge thank you to Educative for sponsoring this season of the show!
The comprehensive and interactive text-based courses give you in-demand tech skills. Get 20% off by going to educative.io/BaseCS
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 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