ChaosTree: Open-Source Java Library Offers Four Tree Implementations With No Dependencies
A developer has released ChaosTree, a zero-dependency Java library that implements four sorted tree data structures: AVL Tree, Red-Black Tree, B-Tree, and B+Tree. The library targets JDK 21 and above, implementing standard Java interfaces such as NavigableSet, NavigableMap, SequencedSet, and SequencedMap. The project grew out of the developer's personal effort to deepen their understanding of data structures, evolving from a Set-only library into a full Set and Map solution with attention to memory layout and JVM performance. ChaosTree has been validated through multiple testing approaches including Guava Testlib compatibility checks, property-based testing with jqwik, and differential testing against Java's built-in TreeMap and TreeSet. The source code and benchmarks are publicly available on GitHub, and the developer is actively seeking community feedback on API design and benchmark methodology.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.
Discussion (0)
Log in to join the discussion and vote.
Log in