“Of all the trees we could've hit, we had to get one that hits back.” - Harry Potter and the Chamber of Secrets
A collection of tree data structures implemented in Rust. These implementations have been written for teaching and learning purposes. They have not been written for performance or extensibility.
Code is formatted using rustfmt. Code is linted using clippy.
Roadmap:
- avl tree
- weak avl tree
- red-black tree
- left-leaning red-black tree
- BB-alpha tree
- splay tree
- binary heap (array-based)
- fibonacci heap
- treap
- b tree
- b+ tree
- trie
- radix tree
- suffix tree
- fenwick tree
- kd-tree
- octree