js递归练习

<script>
        const rootList = [
            { id: 1, parent: null, text: '菜单1' },
            { id: 2, parent: 1, text: '菜单1-1' },
            { id: 3, parent: 1, text: '菜单1-2' },
            { id: 4, parent: null, text: '菜单2' },
            { id: 5, parent: 4, text: '菜单2-1' }
        ]

        function listToTree(rootList, id, list) {
            for (item of rootList) {
                if (item.parent == id) {
                    list.push(item)
                }
            }

            for (item of list) {
                item.children = []
                listToTree(rootList, item.id, item.children)
            }
            return list
        }

        const res = listToTree(rootList, null, [])
        console.log(res);

        // [
        //     {
        //         id: 1, parent: null, text: '菜单1', children: [
        //             { id: 2, parent: 1, text: '菜单1-1',children:[] },
        //             { id: 3, parent: 1, text: '菜单1-2',children:[] },]
        //     },
        //     {
        //         id: 4, parent: null, text: '菜单2', children: [
        //             { id: 5, parent: 4, text: '菜单2-1',children:[] }
        //         ]
        //     }
        // ]
    </script>