For hidden surface removal and ray tracing acceleration using BSP tree, the upper bound for both space and time complexity is O(N2) for N polygons. The expected case is O(N) for most models.
