public Node<T> searchNearestHigher(long value, boolean acceptEquals) {
    	if (root == null) return null;
    	return searchNearestHigher(root, value, acceptEquals);
    }
public Node < T > searchNearestHigher ( long value , boolean acceptEquals ) { if ( root == null ) return null ; return searchNearestHigher ( root , value , acceptEquals ) ; }
Returns the node containing the lowest value strictly higher than the given one.