tree height . asymptotic worst-case running time using theta notation : the worst-case asymptotic running time is o n concode_field_sep Value val concode_elem_sep Node left concode_elem_sep Node root concode_elem_sep Node right concode_elem_sep Key key concode_elem_sep int N concode_field_sep String printKeys concode_elem_sep String prettyPrint concode_elem_sep String printKeysInOrder concode_elem_sep void deleteMax concode_elem_sep Node deleteMax concode_elem_sep boolean isEmpty concode_elem_sep void delete concode_elem_sep Node delete concode_elem_sep void put concode_elem_sep Node put concode_elem_sep boolean contains concode_elem_sep int getHeight concode_elem_sep int size concode_elem_sep int size concode_elem_sep Key median concode_elem_sep Node getMedian concode_elem_sep Value get concode_elem_sep Value get concode_elem_sep String prettyPrintKeys
int function ( ) { int loc0 ; if ( root == null ) return - 1 ; else if ( size ( root ) == 1 ) return 0 ; else { loc0 = getHeight ( root ) ; } return loc0 - 1 ; }