Nicheloom visits: 60,872 all-time · 7,913 in the last 7 days

The opportunity tracker for new startups.

Today: 1,919 launches · Niche of the day: browser-based utility tools · See what launched today →

ChaosTree

A zero-dependency Java tree library (AVL,RBT,B-Tree,B+Tree)

Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.

Want to reach these readers? Sponsor an issue.

What is ChaosTree?ChaosTree is a zero-dependency Java Sorted Set/Map library built around multiple tree implementations.It provides implementations of: - AVL Tree - Red-Black Tree - B-Tree - B+TreeI have not made my custom API as it implements NavigableSet, NavigableMap, SequencedSet and SequencedMap. My Custome API are: - buildFromSorted(Iterator> it, float factor) - importFlatMatrix(Object[][] blast, float factor) - Object[][] exportFlatMatrix()I started ChaosTree because I wanted to explore how far I could learn DS structure, It started as frst release of 7 tree of Set type with Custome API, As i got engrossed into it I moved to Map, During phase of switching from Set to Map there was drastic change and knowledge upgrade where I pushed my Tree limit from jdk11+ support to jdk21+ where paid close attention to dependency-free and memory layout, allocation,JVM behavior, and real-world performance.Some of the things I experimented with: - Different node layouts and metadata footprints - CRTP/F-bounded polymorphism for tree implementations - Parent-pointer vs parentless nodes - Array-based N-ary tree nodes - B-Tree/B+Tree degree selection - JMH benchmarking and JFR profiling - Differential/randomized testing against java.util.TreeMap/TreeSetAfter this rough and tough It also passes these test:-Guava Testlib compatibility testing -jqwik property-based testing -Randomized differential testing against reference collections -White-box structural validation of tree nodes -Direct validation of B-Tree/B+Tree structural invariants -Exception and iterator-contract testing -Serialization and cloning tests -Nary Tree uses custom jqwick test of API validation as well.Tail latency behavior is not shown here because it get's truncated into a simple text which made the dat read wrong:https://chaos-vy.github.io/ChaosTree/utils/JMH-Report.html I have also ran benchmark with official JDK TreeMapUpdate to my N-ary tree.GitHub: https://github.com/Chaos-vy/ChaosTree https://chaos-vy.github.io/ChaosTree/I'd especially like feedback on the API design, implementation choices, benchmark methodology. I am currently trying to truncate useless and complex branches for performnace tuning.

HN · launched Sep 14, 2026 · 9 upvotes (top 46%) · 0 views

Niche: specialized algorithms and computing libraries · 231 launches, 4 in the last 7 days ▼ -73% · Explore this niche →

Category and tags

  • Horizontal
  • Dev tools
  • Developer
  • Not AI
  • Hobby / open-source project

Visit website ↗ Source listing ↗

Could you build this?

Yes Implementing classic self-balancing trees (AVL, Red-Black) and B/B+ trees in Java complying with standard collection interfaces is algorithmic textbook code that modern LLMs can write and test reliably.

Discussion

9 comments analyzed.

Concerns raised: Requiring JDK 21 limits adoption for older JDKs

Feature requests: JDK 11 support or backport, Intrusive variant of trees

Competitors

Other products that read as similar to this one : 54 launches clear the similarity bar, closest 8 shown.

Attention rank: #20 of 55 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).

Launched 314 days after the earliest competitor.

The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.