Node function ( Node arg0 ) { if ( arg0 . right != null ) { return minimum ( arg0 . right ) ; } Node loc0 = arg0 . parent ; while ( loc0 != null && arg0 . equals ( loc0 . right ) ) { arg0 = loc0 ; loc0 = loc0 . parent ; } return loc0 ; }
get the smallest value greater than the one stored in a node x. concode_field_sep Node right concode_elem_sep Node root concode_elem_sep int size concode_elem_sep T key concode_elem_sep Node parent concode_elem_sep boolean allowSameElementMultipleTimes concode_elem_sep Node left concode_field_sep void add concode_elem_sep T popMinimum concode_elem_sep void performDelete concode_elem_sep T lower concode_elem_sep boolean isEmpty concode_elem_sep Node lowerNode concode_elem_sep Node predecessor concode_elem_sep T popMaximum concode_elem_sep void remove concode_elem_sep boolean contains concode_elem_sep Node search concode_elem_sep StringBuffer print concode_elem_sep int size concode_elem_sep T maximum concode_elem_sep Node maximum concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep Node higherNode concode_elem_sep T minimum concode_elem_sep Node minimum concode_elem_sep T higher