True
ChaosTree, a Java library for sorted sets and maps, bills itself as carrying zero external dependencies and being built around multiple tree data structures. To test that self-description, this desk reviewed nine primary sources connected to the project and archived the findings in a research note dated September 14, 2026. The documentation and code examined line up with the library's description on all three fronts: language, dependency footprint and core data structures.
The claim bundles three assertions. First, that ChaosTree is a Java library implementing sorted set and map structures โ the territory of the JDK's SortedSet and SortedMap interfaces, which keep elements in sorted order. Second, that it is "zero-dependency," meaning a project that adopts it pulls in no third-party packages alongside it. Third, that the library is "built around" multiple tree implementations rather than a single tree structure.
The nine primary sources reviewed were consistent on each point. The library presents itself as a Java sorted set and map offering, its distribution attaches no external dependencies, and its design is organized around several tree implementations rather than one. The full list of sources is preserved in the newsroom's archive under factcheck_chaostree_2026-09-14.md.
Developers who need sorted collections in Java most often reach for the standard library's TreeMap and TreeSet, so any third-party entrant in this space tends to differentiate on design and footprint. A zero-dependency promise, when it holds, keeps build files lean and shrinks supply-chain exposure โ a growing concern for enterprise teams auditing what their software actually ships with. A verified claim spares adopters that particular verification step.
The conclusion of this review: the claim that ChaosTree is a zero-dependency Java Sorted Set/Map library built around multiple tree implementations is True.