> Consider a vector of strings (`vector<string>`). The destructor deallocates the memory for all the strings, then deallocates the memory for the vector. A vec

> Consider a vector of strings (`vector<string>`). The destructor deallocates the memory for all the strings, then deallocates the memory for the vector. A vector (or binary tree as you mentioned later) of heap allocated elements in a performance critical path is a likely candidate to be redesigned if possible. > As far as I can tell, you either have to pointer chase or use a custom allocation strategy. At some point with the second option, you're basically creating an ad-hoc garbage collector. A custom, ad-hoc strategy is the way to go if you need them dynamically allocated and performance at the same time, yeah. I wouldn't call that a GC, though. A GC usually refers to a global solution. > But I think we may be in vigorous agreement here Sounds like it!