算法 树遍历 给定树结构数据的任意id,匹配无限树结构数据,得到该树第一层下所有的节点的最后一层数据组成1唯数组

Question

Answer 1

const tree = {
    id: 1,
    children: [
        {
            id: 2,
            children: [
                {
                    id: 3,
                    children: [
                        { id: 4, children: [] },
                        { id: 5, children: [] },
                    ],
                },
            ],
        },
        {
            id: 6,
            children: [
                {
                    id: 7,
                    children: [
                        { id: 8, children: [] },
                        { id: 9, children: [] },
                    ],
                },
            ],
        },
    ],
};

const func = (root) => {
    if (root.children.length === 0) {
        return [];
    }

    const res = [];
    const dfs = (node) => {
        if (node.children.length === 0) {
            res.push(node.id);
            return;
        }
        node.children.forEach(dfs);
    };
    dfs(root);
    return res;
};

console.log(func(tree));