高频交易(HFT)的限额订单簿,如WK Selph所述,在Python 3和C中实现
self-balancing-trees 开源项目推荐(28 个)
self-balancing-trees 话题在 GitHub 上没有填写简介,这里按 Star 数汇总最相关的热门仓库。
热门项目 前 20
按 Star 数排序展示前 20 个 · GitHub 共 28 个仓库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
Card Conquest is an interactive multiplayer card game where players battle to collect all cards by playing the highest card each round. Built with advanced data structures including Red-Black Trees for optimal performance, this game demonstrates real-world application of complex algorithms in gaming systems.
Generic red-black tree implementation for self-balancing binary search 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 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.
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
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 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.
Fast and efficient Prefix-based Autocomplete engine in C# (.NET 10) powered by a Self-Balancing AVL Tree with O(log n) lookup and 2D tree visualization.
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.
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.
Implementation of AVL tree in pure C.
Generic AVL tree implementation and testing in C#
Implementing self-balancing trees with AVL Trees.
Efficient C++ implementation of a Scapegoat Tree, a memory-efficient self-balancing binary search tree. Includes detailed complexity analysis and documentation.
Self-balancing Red-Black Search Tree implementation in Python featuring O(log n) operations, tree rotations, logical deletion, and dynamic stock market price tracking.
关于这个话题
- 清单取自 GitHub 话题页并按 Star 数排序,每次展示前 20 个项目;原始页面见 https://github.com/topics/self-balancing-trees。
- 该话题在 GitHub 上共有 28 个仓库, 本站收录的是其中最热门的 20 个,不是全量列表。
- Star / Fork 每日自动刷新一次,实时数据以 GitHub 为准。
- 当前 20 个项目累计 1457 Star,覆盖 6 种主要语言,数据更新于 2026-11-08。
- 中文介绍来自 GitHub 官方话题说明(github/explore)的机器翻译,可点「查看原文」对照;译文缺失时会先展示原文。