Show HN: ChaosTree – A zero-dependency Java tree library (AVL,RBT,B-Tree,B+Tree)

ChaosTree is a zero-dependency Java library implementing sorted set and map data structures using AVL trees, red-black trees, B-trees, and B+ trees, with APIs compatible with JDK 21's NavigableSet and NavigableMap interfaces. The library prioritizes cache locality through N-ary tree structures that improve CPU cache hit rates by nearly 40% during range scans, and is rigorously validated through Guava Testlib compatibility testing (214,000+ tests), property-based testing, and structural invariant validation. ChaosTree also provides specialized construction APIs that allow developers to control tree node occupancy while maintaining structural integrity.