Array（数组-转树）

// id：唯一值，pid：父级id

  var zNodes = [
    { id: 1, name: 'SeriousLose Home', pid: 0 },
    { id: 2, name: 'SeriousLose in Google', pid: 0 },
    { id: 3, name: 'SeriousLose in ShangHai', pid: 1 },
  ];
  function buildTree(arr) {
    let temp = {};
    let tree = {};
    // 数组转 键值对
    arr.forEach((item) => {
      temp[item.id] = item;
    });
    let tempKeys = Object.keys(temp);
    tempKeys.forEach((key) => {
      let item = temp[key]; // 获取当前项
      let _itemPId = item.pid; // 当前项 父级pid
      let parentItemByPid = temp[_itemPId]; // 获取父级项
      if (parentItemByPid) {
        if (!parentItemByPid.children) {
          parentItemByPid.children = [];
        }
        parentItemByPid.children.push(item);
      } else {
        tree[item.id] = item; // 无父级时
      }
    });
    // 对象转数组并返回
    return Object.keys(tree).map((key) => tree[key]);
  }
  let treeAry = buildTree(zNodes);
  console.log(treeAry);

// 通过双层filter过滤的方式实现；

  const list = [
    { id: 1, name: '一级 1', pid: 0 },
    { id: 2, name: '二级 1-1', pid: 1 },
    { id: 3, name: '二级 1-2', pid: 1 },
    { id: 4, name: '三级 1-1-1', pid: 2 },
    { id: 5, name: '一级 2', pid: 0 },
  ];

  function listToTree(list) {
    return list.filter((e) => {
      let pid = e.pid;
      let newArr = list.filter((ele) => {
        if (ele.id == pid) {
          if (!ele.children) {
            ele.children = [];
          }
          ele.children.push(e);
          return true;
        }
      });
      return newArr.length === 0;
    });
  }
  listToTree(list);