Only by programmers that missed algorithms and data structures classes, unfortunately plenty of them nowadays, fresh out of JavaScript and Python Web bootcamps with zero CS background.
Folks that wonder pre-history tech with amazement and lack of understanding of how it used to work in first place.
The problem in your classic DS&A class is that they spend scant attention if any on the crucial difference between "This big-O evaluation is awesome" and "In the real world this goes fast/ is small"
The Red Black tree, C++ std::map is a classic example. It has these very attractive theoretical properties, but then you try one for real in C++ and oh, why is this so slow and so RAM hungry? Well yeah, those are only real world problems, the big-O numbers don't care about that.
C++ implementation problems are another matter, caused by how WG21 sadly works, than anything else.
Ironically there are C# implementations that perform better, exactly because they were developed without WG21 working environment, in a compiled managed language.
For all the performance minded talk, the walk doesn't always follow.
Also std::map cannot be improved by existing processes.
Naturally there are several ideological questions between that approach from the anti GC crowd, and adopting Rust instead.
Not that breaks the C++ vs Rust from your comment, though.