question: private Node deleteMax ( Node x ) { if ( x . right == null ) return x . left ; x . right = deleteMax ( x . right ) ; x . size = 1 + size ( x . left ) + size ( x . right ) ; x . height = 1 + Math . max ( height ( x . left ) , height ( x . right ) ) ; return balance ( x ) ; }
target:  Removes the largest key and associated value from the given subtree.