用队列实现树的层次遍历

//用队列实现层次遍历

void BinTree::Order(LinkNode * current)
{
    Queue<LinkNode*> q(10);

    if(current==NULL)
         return ;

    q.enQueue(current);//先让current节点入队列

    while(!q.IsEmpty())
    {
           int item=q.getFront()->getData();
           cout<<item<<" ";
           LinkNode* temp=q.deQueue();
          //到此队列已为空

          if(temp->getLChild()!=NULL)
          {
                q.enQueue(temp->getLChild());
          }

          if(temp->getRChild()!=NULL)
         {
                q.enQueue(temp->getRChild());
         }
    }
}