Zero-dependency Java search tree library featuring binary and N-ary families with JMH benchmarks and hardware-counter-backed performance evidence.
-
Updated
Jul 5, 2026 - Java
Zero-dependency Java search tree library featuring binary and N-ary families with JMH benchmarks and hardware-counter-backed performance evidence.
Script outputting the shortest possible way for a chess knight to get from one position on a chessboard to another
Add a description, image, and links to the searchtree topic page so that developers can more easily learn about it.
To associate your repository with the searchtree topic, visit your repo's landing page and select "manage topics."