C++ implementation of a dynamic, self-balancing k-d tree, and of two multi-threaded, static k-d tree-building algorithms that build either a k-d tree, which implements a set, or a k-d tree-based key-to-multiple-value map. Multi-threaded algorithms are included for region search, nearest-neighbor search, and reverse-nearest-neighbor search.

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

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

AVL (self balancing binary search tree)

libf_ds is libf project's data structure implemented extract