Binary-Search Trees, Red-Black Trees, AVL Trees and Heaps
What are trees and why do they matter?
The foundation of simple binary trees.
A Binary Search Tree (BST) is a binary tree with 2 simple, yet important, properties.
A nearly complete binary tree that respects the heap property.
The Red-Black Tree (RBT) is a lazily-structured "self-healing" tree.
Let's dive a little deeper into certain types of tree structures.
