Although the Wiki implementation does not do it but the tree gets better when you move all the points in the current item to its children when subdividing (and redirect all further insert to its children).
In the end points will only reside in the leaves of the tree.
When using the current implementation there are many points being queried that are not even close to the searched range. For instance the points in the root element are always queried no matter where you search. When redistributing to the child nodes you can save about 50% off the points you need to query.