TreeSelect 树形选择卡顿优化

<el-tree-select v-model="value" lazy :load="load" :props="props" />

// 通过懒加载处理优化
// isLeaf必须在定义一下不然最后一级还可以点击
const props = {label: "std_org_name",value: "std_org_code",isLeaf: 'isLeaf', children: "children"};
const list = [{std_org_name:11,std_org_code:11,children:[{std_org_name:22,std_org_code:22,children:[]}]}]
const load = (node, resolve) => {
  if (node.isLeaf) return resolve([])
    // 获取数据下一级
    let datalist = node.data.length==0?list:node.data.children;
    // 验证数据下一级是否还存在
    datalist.forEach(element => {
        element.isLeaf = element.children.length==0?true:false
    });
    // 数据回显
    resolve([
      ...datalist
    ])
}