S9 EP 7
How do you create visual recognition software ethically and responsibly
S9 EP 6
S9 EP 5
S9 EP 4
S9 EP 3
S9 EP 2
S9 EP 1
Join us for our topical coding conversations every Wednesday at 9PM EST.
How was coding this week? Share your goals and your wins every Sunday at 2PM EST.
Vaidehi Joshi co-host, developer, author
Saron Yitbarek co-host, developer, founder
We dive into a tree data structure that can contain more than one key, which is unlike any tree structure we've covered so far. It is also the reason for their name: 2-3 tree.
If you thought self-balancing AVL trees were cool, just wait till you learn about red-black trees, which also run in logarithmic time!
Listen and learn about a pattern that you can use to figure out the minimum number of nodes we’ll need to create any height-balanced AVL tree, how it leads us to the Fibonacci sequence, and the golden ratio.
We look at the earliest version of the height-balanced tree concept: the AVL tree.