int function ( ) { int loc0 = 0 ; if ( root != null ) { root = root . left ; loc0 ++ ; } return loc0 = loc0 + root . countNodes ( ) ; }
returns the number of nodes where exactly one child is null . concode_field_sep Comparable data concode_elem_sep Node left concode_elem_sep Node root concode_elem_sep Node right concode_field_sep void add concode_elem_sep void print concode_elem_sep void print concode_elem_sep void addNode concode_elem_sep boolean find concode_elem_sep void main concode_elem_sep void remove