The author explores alternative implementations of binary trees in C++, moving away from traditional raw pointer usage to a more modern approach that utilizes indexes within a vector and optional types. This method aims to reduce potential cache misses and improve performance, demonstrating a notable speed increase compared to the conventional pointer-based implementation. The article also reflects on the author's preparation for a talk at Meeting C++ 2025 and the insights gained during the experimentation.