根据父子id对应关系将平铺数组处理为树形结构

平铺数组处理为树形结构"/>

根据父子id对应关系将平铺数组处理为树形结构

    handleTree(data, id, ParentID, children, rootId) {id = id || 'id'ParentID = ParentID || 'ParentID'children = children || 'children'rootId = rootId || 0 || '0'// 对源数据深度克隆const cloneData = JSON.parse(JSON.stringify(data))// 循环所有项const treeData = cloneData.filter((father) => {let branchArr = cloneData.filter((child) => {// 返回每一项的子级数组return father[id] == child[ParentID]})branchArr.length > 0 ? (father.children = branchArr) : ''// 返回第一层return father[ParentID] == rootId})return treeData != '' ? treeData : data}