breadth first search binary tree in JavaScript

breadth_first_search.js

function TreeNode(value) {
    this.value = value;
    this.left = null;
    this.right = null;
}

var root = new TreeNode(15);
root.left = new TreeNode(7);
root.right = new TreeNode(26);
root.left.left = new TreeNode(1);
root.left.right = new TreeNode(11);
root.left.left.right = new TreeNode(3);
root.right.left = new TreeNode(22);
root.right.right = new TreeNode(30);
root.right.right.right = new TreeNode(32);
root.right.right.right.left = new TreeNode(31);
root.right.right.right.right = new TreeNode(33);

function traverse(root) {
    var queue = [];

    queue.push(root);

    while(queue.length > 0) {
        var node = queue.shift();

        // print the value
        console.log(node.value);

        if (node.left) {
            queue.push(node.left);
        }

        if (node.right) {
            queue.push(node.right);
        }
    }
}

traverse(root);