Red Green Black Trees: Extension to Red Black Trees

Abstract

This paper propose an extended form of Red Black trees. It presents a new explicit balancing algorithm called Red Green Black trees. This structure tolerates some degree of imbalance that allows a decrease of the number of rebalancing relaxing the update operations. Through the use of three color nodes, the structure tolerates series of two nodes between Black nodes and defines a less balanced tree. It is interesting because the imbalance doesn't affect the update time and save the same level of performances of Red Black trees of O(log(n)). In fact, Red Green Black trees can provide better performances in environment where the restructuring is most frequent with Red Black trees.

M-PBBST(n1, n2) : Multiple Partially Balanced Binary Search Trees in one

“…More information can be found at [21]. [22] deals with an extension of the Red-Black trees using three colors.…”