avl_tree
AVL tree
A high performance C implementation of a self-balancing binary search tree
High performance C implementation of AVL trees
98 stars
8 watching
22 forks
Language: C
last commit: over 5 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
pharo-containers/avl | A Smalltalk implementation of an AVL tree data structure | 4 |
armon/libart | A C implementation of an efficient data structure for fast lookups and prefix matching in memory databases. | 771 |
aagarwal1996/additive_trees | Repository for reproducing experiments and figures from a decision tree paper, implementing additive models for trees | 2 |
zacharypatten/towel | A C# library implementing an AVL tree data structure with additional features. | 726 |
bgamari/b-tree | An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying. | 116 |
begeekmyfriend/bplustree | A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,863 |
kpeeters/tree.hh | An STL-like C++ header-only tree class with n-ary structure and various iterator types. | 133 |
haskell/critbit | An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 |
antirez/rax | An ANSI C implementation of a radix tree data structure | 1,121 |
florentavellaneda/inferdt | This C++ project provides an implementation of decision tree algorithms for classification tasks | 7 |
wyhaines/splay_tree_map.cr | A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
apburt/treeseg | Extracts individual trees from high-density lidar point clouds using machine learning and computer vision techniques | 214 |
tree-sitter/tree-sitter-verilog | A system for parsing and analyzing the Verilog programming language used in digital electronics design. | 93 |
treywood/tree-sitter-proto | A tree-sitter grammar for parsing protocol buffer files | 7 |
clojure/data.avl | A data structure library implementing persistent AVL trees for sorted maps and sets with efficient rank queries, nearest key lookups, and other operations. | 132 |