二叉树层序遍历

void FloorPrint_QUEUE(pTreeNode &Tree) //层序遍历_队列实现
{
queue < pTreeNode> q;
if (Tree != NULL)
{
q.push(Tree); //根节点进队列
}

while (q.empty() == false)  //队列不为空判断
{
    cout << q.front()->data << " → "; 

    if (q.front()->leftPtr != NULL)   //如果有左孩子，leftChild入队列
    {
        q.push(q.front()->leftPtr);   
    }

    if (q.front()->rightPtr != NULL)   //如果有右孩子，rightChild入队列
    {
        q.push(q.front()->rightPtr);
    }
    q.pop();  //已经遍历过的节点出队列
}

}