/**
 * 递归处理树节点
 * @param treeNodes
 * @param cb
 * @returns {*[]}
 */
export const recursionTree = function (treeNodes, cb) {
  return ([].concat(treeNodes)).map(node => {
    if (node.children && node.children.length > 0) {
      node.children = recursionTree(node.children, cb)
    }
    return cb(node)
  })
}