Why is my method going into infinite recursion?

Question

I\'ve written a method to help build a quadtree. Each quadtree has a root node, and a root node has 4 children. I\'m using depth recursion to stop this function from dividin

Answer 1

If the n->isLeaf() condition means "all n's children are null", then I suppose it is always false here.