red-black-trees

Data structures and algorithms in X minutes. Code examples from my YouTube channel.

Throw in the towel.

A small, ergonomic generic container library.

A collection of Data Structures implemented in Swift.

Source Code for HappyCoders.eu article series on tree data structures (binary tree, binary search tree, AVL tree, red-black tree).

A red-black self-balancing interval tree

Fast AVL Trees & WAVL Trees in Java

Red-black tree implementation in Python

A red-black tree and set with callbacks

Fast and Scalable Data Structures for Scientific and Quantitative Research.

This is Giudlines and implementations for serveral Data Strucutres in programming using C++ language.

The project implements a construction project scheduler to keep track of all the buildings under construction using Min Heap and Red Black Trees. These Data Structures help identify the priority and progress of construction.

Red Black trees (as well as linked lists and ordered binary trees) in OCaml

Left-Leaning Red-Black Trees for Ruby

This Jupyter notebook contains a Python 2 implementation of left-leaning red/black trees, a variant of binary search trees, along with code to visualize the trees.

A verified implementation of Left-Leaning Red-Black trees in C and in C++.

A c++ implementation of red black tree struct in memory and file versions

AVL tree: height-balanced trees in C supporting add, remove, search, update features. A comparison of AVL trees with red-black trees is also done(std::set).

Java implementation of augmented red-black trees. Easily maintain custom augmentation information by subclassing RedBlackNode: the base class does the work for you.

An android-based simple dictionary application that uses and implements Red-black trees data structure in Java.