Why is my method going into infinite recursion?
<p>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 dividing too many times. The depth that is passed in is equal to the log base 2 of the side of the square (a square is always passed in). However, I get infinite recursion from this. Anyone see why?</p>

<p>When I run it, the output is "Depth=0" infinitely many times..</p>
