// tableTree树形数据// condition条件// result结果recursiveTraversal(tableTree, condition, result){
for(let index =0; index < tableTree.length; index++){
const element = tableTree[index]if(element.key === condition){
result = element
}elseif(element.children && element.children.length >0){
result =this.recursiveTraversal(element.children, condition, result)}}return result
}