Does this implement sparse quadtree?

Hello,

I am experimenting with quad/octo trees for a project in Golang and am looking for a quadtree implementation that uses sparse tree allocations so that it does not pre-allocate memory of unused space.

Does rquad do this?

Do you have any simple implementation?

Thanks and have a great day