What do you think is the best way of implementing self balancing binary search trees ?

Question

there are many implementations out there like aa trees, scapegoat trees, splay trees or maybe treaps which one do you prefer the most ?

Answer 1

Same here, that's the one used in C++ std::map also.

Answer 2

I prefer red black trees because they are so useful for real time application. due to good insertion delete and search times

Answer 3

glad to see we have the same thought I'm wondering how many people have thoughts on this