A terminal-based interactive visualization tool for learning and exploring tree data structures — no GUI, runs entirely in the command line.
- Binary Trees - Full, complete, perfect, degenerate (yes you've read that right)
- Degenerate tree: Each parent has exactly one child. Might behaves like a linked list. Worst-case O(n) height.
- General Trees - N-ary trees with multiple children
- 2-4 Trees - Balanced search trees where every internal node can have a minimum of 2 children and a maximum of 4 children (holding 1 to 3 keys accordingly), with all leaves maintaining the same depth to ensure O(log n) operations.
- Red-Black Trees - A self-balancing binary search tree where each node has an extra color bit (red or black). Ensures O(log n) search, insert, and delete by maintaining five key properties that keep the tree roughly balanced.
