An ordering that skips prefixes in tree searches
A rust lib contains OrdMap(avl tree) and HashMap(use avl to resolve collision);
A generic Cartesian Merkle Tree implementation
Recursive & Iterative Binary Search Tree Implementations within Rust
Very generic containers including KD trees, fibonacci heaps, minmax heaps, ...
Binary search tree implementation
Trees in Rust
A generic map and a set, both backed by a Radix tree.
A fast B+ Tree implementation that uses integer keys
A crate that provides visualization tools for binary search trees, including ASCII art and SVG generation. Great for educational purposes and debugging.
An optimised interval tree for efficient interval stabbing
Direct ports of the standard library's BTreeMap, BTreeSet and BinaryHeap collections, but that sort according to a specified total order rather than the `Ord` trait
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.