/** * Returns the node with the minimal key wrt. {@link TreeManager#getOrder()}. * For the empty sequence this is {@link TreeManager#getRoot()}. */ protected final Node getMinimal() throws RepositoryException { Node p = null; Node n = root; while ((n = getMinimal(n)) != null) { p = n; } return p; }
/** * Returns the node with the minimal key wrt. {@link TreeManager#getOrder()}. * For the empty sequence this is {@link TreeManager#getRoot()}. */ protected final Node getMinimal() throws RepositoryException { Node p = null; Node n = root; while ((n = getMinimal(n)) != null) { p = n; } return p; }
/** * Returns the node with the minimal key wrt. {@link TreeManager#getOrder()}. * For the empty sequence this is {@link TreeManager#getRoot()}. */ protected final Node getMinimal() throws RepositoryException { Node p = null; Node n = root; while ((n = getMinimal(n)) != null) { p = n; } return p; }