The beauty of the BSP tree is that it used recursion. When first approached this is a challenge to wrap your head around- very similar to the quicksort algorithm. Great read.

These days octtrees more or less replaced BSP trees i guess. They are easier to handle and work better with more polygons.