Function search

javascript/0103-binary-tree-zigzag-level-order-traversal.js:15–28

(root, isZigZag = true, order = [])

};

var search = (root, isZigZag = true, order = []) => {
    const queue = new Queue([root]);

    while (!queue.isEmpty()) {
        /* Time O(N) */
        const levels = [];

        bfs(queue, isZigZag, levels); /* Time O(WIDTH) | Space O(WIDTH) */
        order.push(levels); /*                 Space O(N) */
        isZigZag = !isZigZag;
    }

    return order;
};

const bfs = (queue, isZigZag, levels) => {
    for (let level = queue.size(); 0 < level; level--) {