递归查找搜有的树结构父元素

 // 查找父节点
    familyTree (arr1, orgId) {
      var temp = []
      var forFn = function (arr, orgId) {
        for (var i = 0; i < arr.length; i++) {
          var item = arr[i]
          if (item.orgId === orgId) {
            temp.push(item)
            forFn(arr1, item.parentOrgId)
            break
          } else {
            if (item.children) {
              forFn(item.children, orgId)
            }
          }
        }
      }
      forFn(arr1, orgId)
      return temp
    },

this.org = this.familyTree(this.treeData, res.data.userOrg.orgId).reverse().map(item => item.orgName).join('/')