Throw in the towel.

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

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).

Fast AVL Trees & WAVL Trees in Java

A red-black self-balancing interval tree

Red-black tree implementation in Python

Fast and Scalable Data Structures for Scientific and Quantitative Research.

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

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

Left-Leaning Red-Black Trees for Ruby

A complete Data Structures library in C

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.

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

A Red-Black Tree Implemented in Swift

Red black tree implementation

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).

This repository contains practical implementation of various basic data structures in C Language. It also includes implementation of various advanced and complex data structures like AVL Trees, Red Black Trees, Huffman Coding, Binary Search Trees, Hash Tables, etc. This repository also includes various sorting algorithms like QuickSort, MergeSor…

Backup for Advanced Data Structures class labs