K-d tree: Difference between revisions

nodes_.reserve(n);

for (size_t i = 0; i < n; ++i)

root_ = make_tree(0, nodes_.size(), 0);

}