递归取值时

function deepTree(treeList, name) {
    for (let index = 0; index < treeList.length; index++) {
        const element = treeList[index];
        if (element.name == name) {
            console.log("查询到了该节点");
            return true;
        }
        console.log("遍历树");
        if (element.children && element.children.length) {
            if (deepTree(element.children, name)) {
                return true;
            }
        }
    }
}

    deepTree(treeList, nodeId) {
      for (let index = 0; index < treeList.length; index++) {
        let node = treeList[index]
        if (node.data && node.data.id == nodeId) {
          return node
        } else {
          let cNode = this.deepTree(node.children, nodeId)
          if (cNode) {
            return cNode
          }
        }

      }
    },

https://blog.youkuaiyun.com/weixin_44149978/article/details/105102376