kdtree中边界框之间的最小距离

I need to find the minimum distance b/w two kdtree bounding box's of same tree in euclidean space. Suppose each box maintain a 5 elements. I need the minimum Euclidean distance using java. I need to find the minimum distance b/w two kdt