   Basic quadtree problem
  Hey guys,Just a quick question about quadtrees.I'm just having trouble getting to grips with the number of checks required.Is there any easy way to calculate the number of checks required in quadtress?So lets say, I was checking whether a node in the quadtree contained part of the view frustum, is there any mathematical way to work out how many checks are required to locate all the parts?Cheers guys   
  Never mind, I just realised that what I'm trying to achieve can be done simply by doing a depth-first traversal of the quadtree *doh*   