Why is creating a quadtree O(log n)? | Dark Hacker News