js递归树结构

//递归重组tree数据
        concatTreeData(list,newData, keyId,isLayze) { 
            let isFlag = false;
            list.map((item, index) => { 
                if (item.id == keyId) {
                    if (item.children) {
                        item.children = [...item.children, ...newData]
                    } else { 
                        item.children = newData;
                    }
                    isFlag = true;
                } else { 
                    if (!isFlag) {
                        if (item.children) { 
                            this.concatTreeData(item.children,newData, keyId)
                        }
                     }
                }
              return item
            })
            this.treeDataList = list
        },