treeRecursion 1

#include <iostream>

using namespace std;

string vivesti(int arrayInt, char symbol, int i){
    if(i < arrayInt){
        return symbol + vivesti(arrayInt, symbol, i+1);
    }
}

void buildBody(int userNumber, char symbol, int i){
    vivesti(userNumber, symbol, i);
    cout << "*";
}

string buildTree(int userNumber, int i, char symbol){
    if(i >= userNumber){
        i = 0;
        buildBody(userNumber, symbol, i);
    }else{
        if(i < userNumber*2){
            symbol = ' ';
            int x = userNumber - (i/2);
            cout << vivesti(x, symbol, i);

            symbol = '*';
            x = i+1;
            vivesti(x, symbol, i);

            cout << endl;
            return buildTree(userNumber, i+2, symbol);
        }
    }

}

int main()
{
    int userNumber,i = 0;
    char symbol;
    cout << " Enter number to build a tree - ";
    cin >> userNumber;
    cout << endl;

    buildTree(userNumber, i, symbol);
}