Is need traverse the farther side when the length of PriorityQueue not filled with k items #2
Description
The code https://github.com/gvd/kdtree/blob/master/kdtree.h#L200-L202,
Here is my code, just like the #L191:
if (result.size() >= k && (dx * dx) >= result.top().first) {
return;
}