In reference to Zed Shaw's comment about the simplified red-black tree and 300% performance boost, you can often get that by using a sorted array. As dynamic ar

In reference to Zed Shaw's comment about the simplified red-black tree and 300% performance boost, you can often get that by using a sorted array. As dynamic arrays and sort algorithms are pretty much universally available in the standard libraries, you could easily have a much simpler implementation compared to a red-black tree, and if you are searching more than you are inserting, potentially an order of magnitude better performance.