Trees in C++
summary
Compares a naive pointer/new-delete binary tree against an index-based layout using vector+index nodes and shows the cache-friendly array wins in initial benchmarks; implementation details include boost::variant visitors for node payloads and a stable owning shared_ptr to keep addresses fixed. Notes chatbots reproduce pointer examples often missing deletes. Plans and tools for followup: a unique_ptr pool, replacing raw new/delete, and microbenching on QuickBench to measure how much the gap narrows.
AI-written summary · about
related talks
49mBack to Basics: C++ Smart Pointers
55mUPDATED: Scalable and Low Latency Lock-free Data Structures in C++
58mOptimizing Binary Search
01h 01mHigh performance data structures in boost
48mBack to Basics: Cpp Value Semantics
58mUnderstanding and Mastering C++'s Complexity
11mAnatomy of a Smart Pointer
50mTwo advanced PMR techniques in C++17/20