void getLevelWidth(tree &t, node n, int levelFreqs[], int depth) {
    if (n == NULL)
        return;

    levelFreqs[depth]++;


    while (n != NULL){
        getLevelWidth(t, t.firstChild(n), levelFreqs, depth + 1);
        n = t.nextSibling(n);
        if(n != NULL)
            levelFreqs[depth]++;
    }

}

int width(tree &t, node n){
    int h = getHeight(t, t.root());
    int* maxLev = new int[h]();

    recFindDepths(t, t.root(), maxLev, 0);

    return *max_element(maxLev, maxLev + h + 1);
}