budget/src/main/java/budget/backend/structures/AVLSearchTree.java
private AVLTreeNode<K,V> nextLeftLeaf(AVLTreeNode<K,V> n){
		if ((n.getLeft()).equals(empty))
			return n;
		return nextLeftLeaf(n.getLeft());
	}
/**
	 * find the leftmost descendant of the given node
	 * @param n an AVLTreeNode
	 * @return a leaf, that has no left child
	 */
find the leftmost descendant of the given node
@param n an AVLTreeNode
@return a leaf, that has no left child
find the leftmost descendant of the given node @param n an AVLTreeNode @return a leaf that has no left child
private AVLTreeNode<K,V> nextLeftLeaf(AVLTreeNode<K,V> n){
		if ((n.getLeft()).equals(empty))
			return n;
		return nextLeftLeaf(n.getLeft());
	}
private AVLTreeNode < K , V > nextLeftLeaf ( AVLTreeNode < K , V > n ) { if ( ( n . getLeft ( ) ) . equals ( empty ) ) return n ; return nextLeftLeaf ( n . getLeft ( ) ) ; }
find the leftmost descendant of the given node
 @param n an AVLTreeNode
 @return a leaf, that has no left child
find the leftmost descendant of the given node @param n an AVLTreeNode @return a leaf that has no left child