/** Get the first leaf node of a tree. * @param root tree root * @return first leaf node */ private BSPTree<Euclidean1D> getFirstLeaf(final BSPTree<Euclidean1D> root) { if (root.getCut() == null) { return root; } // find the smallest internal node BSPTree<Euclidean1D> smallest = null; for (BSPTree<Euclidean1D> n = root; n != null; n = previousInternalNode(n)) { smallest = n; } return leafBefore(smallest); }
/** Get the first leaf node of a tree. * @param root tree root * @return first leaf node */ private BSPTree<Euclidean1D> getFirstLeaf(final BSPTree<Euclidean1D> root) { if (root.getCut() == null) { return root; } // find the smallest internal node BSPTree<Euclidean1D> smallest = null; for (BSPTree<Euclidean1D> n = root; n != null; n = previousInternalNode(n)) { smallest = n; } return leafBefore(smallest); }