avl_tree
AVL tree
A high performance C implementation of a self-balancing binary search tree
High performance C implementation of AVL trees
99 stars
8 watching
22 forks
Language: C
last commit: over 5 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| A Smalltalk implementation of an AVL tree data structure | 4 |
| A C implementation of an efficient data structure for fast lookups and prefix matching in memory databases. | 775 |
| Repository for reproducing experiments and figures from a decision tree paper, implementing additive models for trees | 2 |
| A C# library implementing an AVL tree data structure with additional features. | 729 |
| An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying. | 116 |
| A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 |
| A C++ header-only library implementing an n-ary tree data structure with STL-like interfaces | 135 |
| An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 |
| An ANSI C implementation of a radix tree data structure | 1,127 |
| This C++ project provides an implementation of decision tree algorithms for classification tasks | 7 |
| A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
| Extracts individual trees from high-density lidar point clouds using machine learning and computer vision techniques | 216 |
| A system for parsing and analyzing the Verilog programming language used in digital electronics design. | 95 |
| A tree-sitter grammar for parsing protocol buffer files | 7 |
| A data structure library implementing persistent AVL trees for sorted maps and sets with efficient rank queries, nearest key lookups, and other operations. | 132 |