A lock-free, persistent, self-balancing binary search tree implementation that leverages Java's ForkJoinPool for highly efficient parallel set operations.
-
Updated
Nov 8, 2025 - Java
A lock-free, persistent, self-balancing binary search tree implementation that leverages Java's ForkJoinPool for highly efficient parallel set operations.
AVL (self balancing binary search tree)
Add a description, image, and links to the self-balancing-binary-search-tree topic page so that developers can more easily learn about it.
To associate your repository with the self-balancing-binary-search-tree topic, visit your repo's landing page and select "manage topics."