Recursion with AVL trees, function minimization

Question

I have made these two functions that find if any AVL tree contains a string that starts with \'a\':

int check2( int x, AVLNode T )
{
    if(x == 1)
        re