Radix Tree implementation for Crystal
- crystal
- radix-tree
Repository Index
47,133 repositories indexed
1–3 of 3 · Most stars
Crystal implementation of "K-Dimensional Tree" and "N-Nearest Neighbors"
- crystal
- k-dimensional
- data-structures
- tree-structure
This is a Crystal implementation of a Splay Tree; which is a type of binary search tree that is semi-balanced and that tends to self-optimize so that the most accessed items are the fastest to retrieve.