What do you call a search tree with a split factor of 2^k
, where k
is the dimensionality of the data points stored within the tree? (The data points are vectors x_1, ... x_k
)
For k=1
we would get a normal binary search tree. For k=2
we would split into 4 quadrants in every node in the tree, etc.
What would be the proper name for such a tree for arbitrary k
?