Is anyone able to tell me what the time complexity would be for registering an object in a quadtree structure, with n levels of subdivision? I'm writing a paper and suddenly realised I've never been too good on this.
It appears to be:
Best-case O(1)
Average/worst-case O(n)
But I'd appreciate any confirmation.
Cheers!
