public Node < T > searchNearestLower ( int value , boolean acceptEquals ) { if ( root == null ) return null ; return searchNearestLower ( root , value , acceptEquals ) ; }
Returns the node containing the highest value strictly lower than the given one .