Red-Black versus AVL: benchmarks

The results of the benchmarks below are thus because of the fact that my computer does not have enough RAM to take advantage of the amortized constant time of the red-black balancing compared to the logarithmic time of the AVL balancing. The red-black balancing functions are longer, and so the height needs to be very large for it to catch up to the AVL and surpass it. See my blog post on the issue here.

Red-Black Trees

    This is a tutorial on coding red-black trees. I have tried to make it as easy to understand and detailed as possible. It covers both insertion and deletion from a red-black tree data structure.