题解 | #按之字形顺序打印二叉树#

/*
 * function TreeNode(x) {
 *   this.val = x;
 *   this.left = null;
 *   this.right = null;
 * }
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param pRoot TreeNode类
 * @return int整型二维数组
 */
function Print(pRoot) {
    const res = [];

    if (!pRoot) {
        return res;
    }

    const queue = [];
    let flag = false;
    queue.push(pRoot);

    while (queue.length) {
        let size = queue.length;
        const temp = [];

        while (size-- > 0) {
            const node = queue.shift();
            temp.push(node.val);

            node.left && queue.push(node.left);
            node.right && queue.push(node.right);
        }

        flag && temp.reverse();

        flag = !flag;
        res.push(temp);
    }

    return res;
}
module.exports = {
    Print: Print,
};