遍历树

// 遍历树
export const traverseTree = (tree, action) => {
  let stack = [];
  if (tree instanceof Array) {
    stack = tree;
  }

  while (stack.length) {
    const node = stack.shift();
    action(node);

    if (node.children) {
      stack = node.children.concat(stack); // 深度优先 或 广度优先
    }
  }
};