🚀 go-pugleaf

Does anyone have an implimentation of a heap I could crib?
I'm playing with an old program that generates points with x,y,
coordinates. These represent the branches of an individual plant and
I need a fast way of searching through these to ensure I don't
put a point close to where one point is already situated. Previously
the data has been stored in binary trees representing the whole structure
of the individual plant, and I have searched through these trees checking
each coordinate. Now I need a quicker way of doing this and so I thought a 
separate heap of individual points would solve the problem, by going quickly
to the points closest to the x y coordinates of the current point, maybe on the
x coordinate first, then going to the y coordinates. Is it possible to 
impliment a 'double ' heap, based on x coords, then y coords?

Any help will be gratefully appreciated and acknowledged if the work gets
to publication!
Thanks in advance,
Henry Ford