Looking at binary trees in C++

Explores alternative implementations of binary trees in C++ beyond the traditional pointer-based approach. Demonstrates using index-based references into a vector with optional elements instead of raw pointers, achieving 1.3-1.7x performance improvement by reducing cache misses and improving memory locality. Compares the naive pointer implementation with a data-oriented design approach inspired by Vittorio Romeo's CppCon keynote, showing how std::vector, std::optional, and index-based navigation can optimize tree traversal performance.