Limit Order Book for high-frequency trading (HFT), as described by WK Selph, implemented in Python3 and C

A red-black self-balancing interval tree

A C implementation of a self-balancing order statistic AVL tree

🌳 Implementation of self-balancing trees in Elm

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

Generic red-black tree implementation for self-balancing binary search trees

The project is a menu-driven application for student courses database where the user is able to perform operations like adding a course, searching for a courses or deleting a course, etc.

A small package of basic data structures and algorithms; currently focusing on BinaryTrees and structures that utilize BinaryTrees. This is very much in development, but please take a look at the README.md and tell me what you think

A short program that implements a Red-Black Tree in C++, offering a balanced binary search tree with operations for insertion, deletion, and traversal, ensuring optimal search times and balanced tree structure.

A C++ project implementing a self-balancing AVL tree for efficient word frequency counting. This program analyzes text files, finds unique words, tracks word occurrences, and prints results in alphabetical order for ease of viewing.

Generic AVL tree implementation and testing in C#

Created a Phone Directory using AVL tree (self-balancing tree) in C++ using File Handling to store the Phone Numbers.

A complete, self-balancing AVL tree implementation in C++ with O(log n) time complexity for all major operations. Features include automatic rebalancing through rotations, generic key-value storage, and full memory management with copy constructor and assignment operator. Includes example usage and easy integration options for your projects.

Implementing self-balancing trees with AVL Trees.

A self-balancing binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.

B+ self-balancing tree implementation using C++

Implementation of AVL tree in pure C.

self-balancing binary research tree

Project to show performance comparison of AVL tree against SkipList in different cases

This program is a special version of the malloc and free library routines that checks on common heap allocation and usage mistakes.