Why are Red_Black trees better than 2-3 trees?
Apart from red-blacks being easier to implement.

All operations (insertion, deletion, lookup) seem to have a time complexity of O(log n), in both trees. Is there a certain difference between these operations that I'm missing?


If you google search "red-black" "2-3 tree", you don't find any comparison between the two..

I've come to understand that red-blacks are generally considered to be the best. (I've also heard that one of the reasons is efficiency in "application to persistent data structures", because of rebalancing efficiency; but that doesn't answer my question..)

Any help would be much appreciated! :)
Why are Red_Black trees better than 2-3 trees?
===

Apart from red-blacks being easier to implement.

All operations (insertion, deletion, lookup) seem to have a time complexity of O(log n), in both trees. Is there a certain difference between these operations that I'm missing?


If you google search "red-black" "2-3 tree", you don't find any comparison between the two..

I've come to understand that red-blacks are generally considered to be the best. (I've also heard that one of the reasons is efficiency in "application to persistent data structures", because of rebalancing efficiency; but that doesn't answer my question..)

Any help would be much appreciated! :)