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.

Implementation of AVL tree in pure C.

Implementing self-balancing trees with AVL Trees.

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.

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.

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

B+ self-balancing tree implementation using C++

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

Classical data structures: C++: vector, linked list, stack, queue, binary search tree, and graph representations. Worst-case analysis, amortized analysis, and big-O notation. Object-oriented and recursive implementation of data structures. Self-resizing vectors and self-balancing trees. Empirical performance measurement.

self-balancing binary research tree

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