递归重构改造
改造前：

export function refactTreeData (tree, node) {
  if (tree && tree.length > 0) {
    for (const branch of tree) {
      if (branch) {
        for (const key in branch) {
          if (key === node) {
            if (branch[key] && branch[key].length < 1) {
              // console.debug(`refactTreeData find ${key} is null`)
              branch[key] = undefined
            } else {
              refactTreeData(branch[key], key)
            }
            break
          }
        }
      }
    }
  }
  return tree
}

改造后：

export function refactTreeData (tree, node) {
  if (tree && tree.length > 0) {
    for (const branch of tree) {
      if (branch && branch[node] && branch[node].length < 1) {
        branch[node] = undefined
      } else {
        refactTreeData(branch[node], node)
      }
    }
  }
  return tree
}