template<class T, class KEY>
void AVLTree<T, KEY>::getArraySize(Node<T,KEY>* current, int* size,
		                          Predicate<T>& func) const {
	if (current == NULL){
		return;
	}
	getArraySize(current->left, size, func);
	if (func(current->getData())) { //TODO: to fix
		(*size)++;
	}
	getArraySize(current->right, size, func);
}

template<class T, class KEY>
StatusType AVLTree<T,KEY>::putInArray(Node<T,KEY>* current, KEY** arr,
		int size, int &index,  Predicate<T>& func) const {
	if (current == NULL) {
		return SUCCESS;
	}
	putInArray(current->right, arr, size, index, func);
	if (func(current->getData())) {
		arr[index] = current->getData();
		index++;
	}
	putInArray(current->left, arr, size, index, func);
	return SUCCESS;
}