Tree algorithms explained: Ball Tree Algorithm vs. KD Tree vs. Brute Force

Understand what’s behind the algorithms for structuring Data for Nearest Neighbour Search

Hucker Marius
Towards Data Science
8 min readJun 15, 2020

--

source: pixabay.

All three are algorithms used for the Nearest Neighbour search. The Ball Tree and the KD Tree algorithm are tree algorithms used for spatial division of data points and their allocation into…

--

--