2023-02-21 树结构数据处理 -- 迭代

树结构数据处理 -- 迭代

getTreeData() {
  let data = [
    { id: "111", pid: "111", name: "11dwada1" },
    { id: "222", pid: "222", name: "dwadada" },
    { id: "33333", pid: "111", name: "dawwdada" },
    { id: "44444", pid: "33333", name: "6dadada" },
    { id: "555", pid: "44444", name: "6dadada" },
    { id: "666", pid: "222", name: "6dadada" },
    { id: "777", pid: "555", name: "6dadada" },
  ];
  let pdataBase = data.filter(item => item.id === item.pid);
  let leftdata = data.filter(item => item.id !== item.pid);
  function getSubs(leftdata,pdata,callback) {
    if(leftdata.length > 0) {
      let pdataIds = pdata.map(item => item.id)
      let pdataTo = [];
      pdata.forEach(v => {
        v.children = leftdata.filter(subv => subv.pid === v.id);
      });

      for (let index = 0; index < pdata.length; index++) {
        const subPs = pdata[index].children;
        pdataTo.push(...subPs)
      }
      leftdata = leftdata.filter(v => !pdataIds.includes(v.pid)) 
      pdata = pdataTo
      getSubs(leftdata,pdata,callback)
    } else {
      callback(pdataBase)
    }
  }
  getSubs(leftdata,pdataBase,function(res) {
    console.log(res);
  })
},