js递归遍历树形结构，数组扁平化

// 递归遍历
    getDeepData(data){
      const {
        selectList
      } = this
      let orgCopy = common.deepCopy(data)
      let listCopy = [orgCopy]
      function loop(node){
        node.forEach(item =>{
          item.label = item.name
          if(item.children && item.children.length > 0){
            loop(item.children);
          }
          selectList.push(item)
          return selectList
        })
      }
      loop(listCopy)
      return selectList;
    },