Home

llrbtree - Left-leaning Red Black Trees

This project implements a variant of Red-Black trees, the Left-Leaning Red-Black (LLRB) tree. A LLRB tree implements the original design goals of Red-Black trees and produces code for insertion and deletion operations, while maintaining a balanced-tree, that is much simpler and faster than many of the solutions currently popular for Binary Search Trees (BST). The algorithm employed is based on an original algorithm developed by Robert Sedgewick at Princeton University.

The goal of this project is to produce a realization of the algorithm in the form of static and dynamic libraries for use in as many programming languages as possible.