利用递归遍历数据结构：选择与子节点处理-CSDN博客

本文链接：https://blog.csdn.net/qaakd/article/details/122936686

           //计算
           count(data) {
               if (data) {
                   for (let i = 0; i < data.length; i++) {
                       if (data[i].isRight == 1) {
                           this.selectedKeys.push(data[i].id);
                       }

if (data[i].children != null) {

                           if (data[i].isRight == 1) {
                               this.selectedKeys.push(data[i].id);
                           }

this.diGUi(data[i].children);
}

                   }
                   this.treeData = data;
               }
           },

diGUi(data) {

for (let i = 0; i < data.length; i++) {

                   if (data[i].isRight == 1) {
                       this.selectedKeys.push(data[i].id);
                   }

                   if (data[i].children != null) {
                       console.log(data[i]);
                       this.diGUi(data[i].children);
                   }
               }

}