budget/src/main/java/budget/backend/structures/AVLSearchTree.java
private ArrayList<V> inOrder(AVLTreeNode<K,V> n){
		ArrayList<V> ret = new ArrayList<>();
		if ((n != null) && (!(n.isEmpty()))){
			ret.addAll(inOrder(n.getLeft()));
			ret.add(n.getValue());
			ret.addAll(inOrder(n.getRight()));
		}
		return ret;
	}
/**
   * fill sortedArray with the values stored in the tree in in-order traversal
   */
fill sortedArray with the values stored in the tree in in-order traversal
fill sortedArray with the values stored in the tree in in - order traversal
private ArrayList<V> inOrder(AVLTreeNode<K,V> n){
		ArrayList<V> ret = new ArrayList<>();
		if ((n != null) && (!(n.isEmpty()))){
			ret.addAll(inOrder(n.getLeft()));
			ret.add(n.getValue());
			ret.addAll(inOrder(n.getRight()));
		}
		return ret;
	}
private ArrayList < V > inOrder ( AVLTreeNode < K , V > n ) { ArrayList < V > ret = new ArrayList < > ( ) ; if ( ( n != null ) && ( ! ( n . isEmpty ( ) ) ) ) { ret . addAll ( inOrder ( n . getLeft ( ) ) ) ; ret . add ( n . getValue ( ) ) ; ret . addAll ( inOrder ( n . getRight ( ) ) ) ; } return ret ; }
fill sortedArray with the values stored in the tree in in-order traversal
fill sortedArray with the values stored in the tree in in - order traversal