budget/src/main/java/budget/backend/structures/AVLSearchTree.java
public AVLTreeNode<K,V> insertAndReturn(K key, V value){
		AVLTreeNode<K,V> n = insertAndReturn(key);
		if (!(n.isEmpty())) n.setValue(value);
		return n;
	}
/**
	 * insert a new node to the tree and set its value. 
	 * @see {@link insertAndReturn(K)} for further explanation
	 * @param key
	 * @param value
	 * @return the inserted AVLTreeNode if the insertion was successfull
	 * @return the empty node otherwise
	 */
insert a new node to the tree and set its value.
insert a new node to the tree and set its value .
public AVLTreeNode<K,V> insertAndReturn(K key, V value){
		AVLTreeNode<K,V> n = insertAndReturn(key);
		if (!(n.isEmpty())) n.setValue(value);
		return n;
	}
public AVLTreeNode < K , V > insertAndReturn ( K key , V value ) { AVLTreeNode < K , V > n = insertAndReturn ( key ) ; if ( ! ( n . isEmpty ( ) ) ) n . setValue ( value ) ; return n ; }
insert a new node to the tree and set its value.
insert a new node to the tree and set its value .