Base.cs Podcast

When going through a maze, hitting a dead end isn't always a bad thing, especially in depth-first search (DFS).

Take a deep breath as we dive into breadth-first search, a super nifty graph traversing algorithm, which gives the shortest way to get from one node to another.

Adjacency lists are the new type of hybrid you're going to want to be driving around your code.

We tackle representing graphs and the parts that make it up.

You won't want to miss the buzz about b-trees, the general version of a 2-3 tree, and a super efficient data storing tree structure.

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.

Take a listen as our binary "dog" barks up the PATRICIA tree.

Recycle, reuse, reduce your space by compressing your tries and creating radix trees.

"Do or do not, there is no tries...wait, yes we're still talking tries."

Branch out with us into the tree-like data structure that is tries.

We're getting to the root of where sorting algorithms began with radix sort ("radix" is latin for "root," this is a funny joke I assure you).

We are nearing the end of our deep-dive into sorting algorithms, and looking at the beautiful efficiency of counting sort.