通过递归取出树结构所有对应数据

<el-tree
      v-show="true"
      class="filter-tree"
      :props="defaultProps"
      accordion
      node-key="LABEL"
      :default-expanded-keys="[mydata]"
      :data="treedata2"
      :indent="0"
      :check-on-click-node="true"
      @check="setSelectedNode"
      :filter-node-method="filterNode"
      ref="tree2"
    >
     
    </el-tree>

data() {
    return {
    mydata: "",
      searchList: [],
      treedata2: [],
      restaurants: [],
    };
  },

mounted() {
    
    searchPvtreeTwo()
      .then(res => {
        this.treedata2 = res.data.data;
        //取出数据中所有LABEL
        this.setName(this.treedata2);
        if (this.treedata2[0].LABEL) {
          this.mydata = this.treedata2[0].LABEL;
        }
      })
      .catch(res => {});
  },

methods: {
setName(datas) {
      //遍历树  获取label数组
      for (var i in datas) {
        this.searchList.push({ value: datas[i].LABEL });
        if (datas[i].children) {
          this.setName(datas[i].children);
        }
      }
    },
}