是的，通常树链剖分是这样，以luogu树剖模板为例

void dfs1 (int x)
{
    vertex[x].size = 1;
    for(register int now = vertex[x].head; now; now = edge[now].link)
    {
        register int v = edge[now].to;
        if(v == vertex[x].f)
            continue;
        vertex[v].f = x;
        vertex[v].deep = vertex[x].deep + 1;
        dfs1(v);
        vertex[x].size += vertex[v].size;
        if(vertex[v].size > vertex[vertex[x].son].size)
            vertex[x].son = v;
    }
}

void dfs2 (int x, int y)
{
    vertex[x].top = y;
    vertex[x].id = ++tot;
    add_tree(1,1,n,vertex[x].id,vertex[x].id,vertex[x].value);
    if(vertex[x].son)
        dfs2(vertex[x].son, y);
    for(register int now = vertex[x].head; now; now = edge[now].link)
    {
        register int v = edge[now].to;
        if(v == vertex[x].f)
            continue;
        if(v == vertex[x].son)
            continue;
        dfs2(v, v);
    }
}

你可以看这个