一维数组转树形结构 递归

  function arrayToTree(flatArray, parentId = null) {
                const tree = [];

                flatArray.forEach(item => {
                    if (item.parentId === parentId) {
                        const c = arrayToTree(flatArray, item.id);
                        if (c.length) {
                            item.children = c;
                        }
                        tree.push(item);
                    }
                })
                return tree;

            }


            let data =
                [
                    { id: 1, name: 'Node 1', parentId: null },
                    { id: 2, name: 'Node 1.1', parentId: 1 },
                    { id: 3, name: 'Node 1.1.1', parentId: 2 },
                    { id: 4, name: 'Node 1.1.2', parentId: 2 },
                    { id: 5, name: 'Node 1.2', parentId: 1 },
                    { id: 6, name: 'Node 2', parentId: null },
                    { id: 7, name: 'Node 2.1', parentId: 6 },
                ]

            const treess = arrayToTree(data);

            console.log(treess);