budget/src/main/java/budget/backend/structures/AVLSearchTree.java
private void updateNodeH(AVLTreeNode<K,V> n){
		int bigger = Math.max((n.getLeft()).getSubtreeHeight(), (n.getRight()).getSubtreeHeight());
		
		n.setSubtreeHeight(bigger+1);
	}
/**
	 * update the height of one node. It is always one more than its higher subtree
	 * @param n an AVLTreeNode
	 */
update the height of one node. It is always one more than its higher subtree
@param n an AVLTreeNode
update the height of one node . It is always one more than its higher subtree @param n an AVLTreeNode
private void updateNodeH(AVLTreeNode<K,V> n){
		int bigger = Math.max((n.getLeft()).getSubtreeHeight(), (n.getRight()).getSubtreeHeight());
		n.setSubtreeHeight(bigger+1);
	}
private void updateNodeH ( AVLTreeNode < K , V > n ) { int bigger = Math . max ( ( n . getLeft ( ) ) . getSubtreeHeight ( ) , ( n . getRight ( ) ) . getSubtreeHeight ( ) ) ; n . setSubtreeHeight ( bigger + 1 ) ; }
update the height of one node.
update the height of one node .