js 实现list和tree相互转化的方法示例

数组转树

 let tree = [
      { id: 1, parentId: null, name: 'a' },
      { id: 2, parentId: null, name: 'b' },
      { id: 3, parentId: 1, name: 'c' },
      { id: 4, parentId: 2, name: 'd' },
      { id: 5, parentId: 1, name: 'e' },
      { id: 6, parentId: 3, name: 'f' },
      { id: 7, parentId: 4, name: 'g' },
      { id: 8, parentId: 7, name: 'h' },
    ]
    arrTree(arr) {
    // 双循环
      arr.forEach(e => { // 父循环
        arr.forEach(y => { // 子循环
          if (y.parentId == e.id) { // 子取parentId和父id做对比
            if (!e.children) {
              e.children = []
            }
            e.children.push(y) // 把子添加父
          }
        })
      })
      arr = arr.filter(ele => ele.parentId === null) // 过滤
      return arr
    }
  }
   this.arrTree(tree) // 调用

树转数组

arrList (data, pid) {
    return data.reduce((arr, { id, name, children = [] }) => // (上次调用函数的返回值,当前元素)
        arr.concat([{ id, name, pid }], this.arrList(children, id)), [])
}
this.arrList（tree, null）

arrList (arr) {
      let result = []
      for (let i = 0; i < arr.length; i++) {
        const obj = arr[i]
        const clone = JSON.parse(JSON.stringify(obj)) // 复制一份并删掉children,push到新数组
        delete clone.children
        result.push(clone)
        if (obj.children) { // 旧数据用来做对比
          const tmp = this.arrList(obj.children)
          result = result.concat(tmp) //返回数组与现在数组合并
        }
      }
      return result
    },