Some relevant knowledge and trees

Q. tree for each sub-tree size:

 

void get_size(int x) {
    siz[x] = 1;
    for (int i = 0;i < vec[x].size();i++) {
        get_size(vec[x][i]);
        [x] + = [VEC [x] [i]];
    }
}

 

 

Q. depth of each node of the tree:

 

void get_dep(int x) {
    for (int i = 0;i < vec[x].size();i++) {
        dep [vectors [x] [i]] = dep [x] + 1 ;
        get_dep(vec[x][i]);
    }
}

 

Q. tree tree each point right maximum points:

 

void get_val(int x) {
    val[x] = w[x];
    for (int i = 0;i < vec[i].size();i++) {
        get_val(vec[x][i]);
        val[x] = max(val[x],val[vec[x][i]]);
    }
}