tree转换成list---递归遍历

//包含es6语法，不兼容ie
treeToArray (list, newArr = []) {
      list.forEach((item) => {
        const { children } = item
        if (children) {
          delete item.children

          if (children.length) {
            newArr.push(item)
            return this.treeToArray(children, newArr)
          }
        }
        newArr.push(item)
      })
      return newArr
},

//兼容ie浏览器
function treeToArray (list) {
    let stack = list,
        data = [];
    while(stack.length != 0){
      let shift = stack.shift();
      data.push({
        id: shift.id,
        typeName: shift.typeName,
        typeImg: shift.typeImg,
        remark: shift.remark,
        englishName: shift.englishName,
        classifyType: shift.classifyType,
        pid: shift.pid
      })
      let children = shift.children
      if(children){
        for(let i = 0; i < children.length; i++){
          stack.push(children[i])
        }
      }
    }
    return data
  }