The goal of such an algorithm is to produce a tree that will efficiently support queries of the desired type (e.g. nearest-neighbor) efficiently in the average case.
Cilj takvih algoritama je da naprave stabla koja će efikasno podržati upite željenih tipova(npr. najbliži sused) u prosečnom slučaju.