Projects / Red-Black Tree C Code

Red-Black Tree C Code

Red-Black Tree C Code provides a way to implement binary trees that are guaranteed to be "balanced". This means that operations such as insert, delete, query, find predecessor, or successor will run in O(log n) time in the worst case. The code is written in C, and allows for generic keys and records. A rudimentary test script is included to demonstrate functionality and memory safety.

Tags
Implementation
Screenshot

Project Spotlight

OpenStack4j

A Fluent OpenStack client API for Java.

Screenshot

Project Spotlight

TurnKey TWiki Appliance

A TWiki appliance that is easy to use and lightweight.