根据id递归出对应父级id及当前id

根据id递归出对应父级id及当前id

  function recursionfind (id, arr, path) {
      if (path === undefined) {
        path = []
      }
      for (let i = 0; i < arr.length; i++) {
        const tmpPath = path.concat()
        tmpPath.push(arr[i].deptId)
        if (id === arr[i].deptId) {
          return tmpPath
        }
        if (arr[i].children !== null) {
          const findResult = recursionfind(id, arr[i].children, tmpPath)
          if (findResult) {
            return findResult
          }
        }
      }
    }
    
recursionfind(id, list)