Given the existance of a queue of pointers and a Binary Tree whose root
node is pointed to by 'root', execution of the following algorithm will
result in a Breadth First Traverssal of the Binary Tree.

void traverse(Node * root)

    Node * t;
    queue.push(root);  { push root }
    while the queue is not empty
      loop
        t = queue.pop();
        output t->info;
        if t->ll > 0 then queue.push(t->ll);
        if t->rl > 0 then queue.push(t->rl);
      end loop