Breadth first traversal in binary tree

//BreadthFirst Traversal
void BreadthFirst(Node* pNode)
{
queue que;
while(pNode!= NULL)
{
cout<<" "<Val;
if(pNode->Left != NULL)
que.push(pNode->Left);
if(pNode->Right != NULL)
que.push(pNode->Right);
if(!que.empty())
{
pNode = que.front();
que.pop();
}
else
pNode = NULL;
}
}