Java and C++ implementations of a dynamic, self-balancing k-d tree and a k-d tree-based key-to-multiple-value map, and multi-threaded implementations of a static k-d tree and a k-d tree-based key-to-multiple-value map. Also included are algorithms for nearest-neighbor search, region search, and reverse nearest-neighbors search.

A Python implementation of a self balancing binary search tree (AVL Tree). Useful to practice, study and see how the SBBTs works.

Provides a basic implementation of weight-balanced binary trees.

A Typescript implementation of an AVL tree, which is a self-balancing binary search tree.

AVL (self balancing binary search tree)

A lock-free, persistent, self-balancing binary search tree implementation that leverages Java's ForkJoinPool for highly efficient parallel set operations.

libf_ds is libf project's data structure implemented extract

Interactive AVL Tree Visualizer — Real-time GUI for insert, search, and delete operations with automatic balancing, performance metrics, and visual feedback. Pure C + Win32 API.