Partitioned Binary Search Trees: a generalization of Red Black Trees

Resumen

We propose a generalized form for Red Black Trees. The structure, called Partitioned Binary Search Trees, tolerates finite successions of Red nodes provoking a degree of imbalance while reducing the number of maintenance operations and speeding up the updates. The tree is interesting not only because of its simple operations but also because it insures the same level of performance of Red Black Trees O(log(n)) and allows an even higher adaptability and efficiency rate in different fields where rebalancing is costly.