实现一个函数，可以将数组转化为树状数据结构

<script>
  const arr = [
    { id: 1, name: "i1" },
    { id: 2, name: "i2", parentId: 1 },
    { id: 4, name: "i4", parentId: 3 },
    { id: 3, name: "i3", parentId: 2 },
    { id: 8, name: "i8", parentId: 7 }
  ];

  //调用
   console.log(buildTree(arr))
   function buildTree(items) {
     const result = [];   // 存放结果集
     const itemMap = {};  // 
     for (const item of items) {
       const id = item.id;
       const pid = item.parentId;
     if (!itemMap[id]) {
        itemMap[id] = {
          children: [],
        }
      }

    itemMap[id] = {
      ...item,
      children: itemMap[id]['children']
    }
    
    const treeItem =  itemMap[id];

    if (pid === undefined) {
      result.push(treeItem);
    } else {
      if (!itemMap[pid]) {
        itemMap[pid] = {
          children: [],
        }
      }
      itemMap[pid].children.push(treeItem)
    }

  }
   return result;
  }
</script>