递归列表树

//递归列表树
        foo1(data, id, parentId, children, rootId) {
          id = id || 'id'
          parentId = parentId || 'categoryId'
          children = children || 'children'
          rootId = rootId || Math.min.apply(Math, data.map(item => { return item[parentId] })) || null
          // 对源数据深度克隆
          const cloneData = JSON.parse(JSON.stringify(data))
          // 循环所有项
          const treeData = cloneData.filter(father => {
            const branchArr = cloneData.filter(child => {
              // 返回每一项的子级数组
              return father[id] === child[parentId]
            })
            branchArr.length > 0 ? father.children = branchArr : ''
            // 返回第一层
            return father[parentId] === rootId
          })
          return treeData !== '' ? treeData : data
      },