Summary

The insert algorithm as described above is a suboptimum solution for the problem of searching for intersecting bounding-boxes within 2D space. Mostly it has much better time complexity than successive passing of bounding-boxes ( $O(q\cdot \log n)$ vs. $O(q\cdot n)$). And it has only O(n) memory consumption. It can be easily extended for 3D space if we take ratios of volumes instead of areas.