将父子id的数组转为树形

 <script>
    let arr = [
      {
        id:0,
        name:'一级0'
      },
      {
        id:1,
        name:'一级1'
      } ,{
        id:2,
        name:'一级2'
      },
      {
        id:'0-1',
        name:'1-二级1',
        parentId:0
      },
      {
        id:'0-2',
        name:'1-二级2',
        parentId:0
      },
      {
        id:'1-1',
        name:'2-二级2',
        parentId:1
      }
    ]
   const tree = arr.filter(p=>{
    const son = arr.filter(s=>{
      return s.parentId == p.id
    })
    son.length?p['child'] = son:''
    return p.parentId == null
  })
  </script>