这个c++程序怎么改才对，求大神

Question

#include <iostream>
#include<queue>
#include <string>
using namespace std;

class BiTreeNode
{
public:
char data; //dote
BiTreeNode *LeftChild; //left*
BiTreeNode *RightChild; //right*
BiTreeNode():LeftChild(NULL),RightChild(NULL){}
~BiTreeNode(){}
};

class BiTree
{
private:
BiTreeNode *Root; //root*
int pos;
string strTree;
BiTreeNode* CreateBiTree();
public:
BiTree(){};
~BiTree(){};
void CreateTree(string TreeArray);
void levelorder();

};

void BiTree::CreateTree(string TreeArray)
{
pos = 0;
strTree.assign(TreeArray);
Root = CreateBiTree();
}

BiTreeNode* BiTree::CreateBiTree()
{
BiTreeNode *T;
char ch;
ch = strTree[pos++];
if(ch == '0')
T = NULL;
else
{
T = new BiTreeNode();
T->data = ch;
T->LeftChild = CreateBiTree();
T->RightChild = CreateBiTree();
}
return T;
}
void BiTree::levelorder()
{
queue<BiTreeNode*>q;
BiTreeNode *p;
p=Root;
if(p!=NULL)
q.push(p);
while(!q.empty()){
cout<<p->data;
if(p->LeftChild!=NULL)
q.push(p->LeftChild);
if(p->RightChild!=NULL)
q.push(p->RightChild);
}
}

int main()
{
int t,i;
string s1;
BiTree test;
cin>>t;
for(i = 0;i < t;i++)
{
cin>>s1;
test.CreateTree(s1);
test.levelorder();

}
return 0;
}
实现层次遍历的程序，从上到下，从左到右

Answer 1

void BiTree::levelorder()
{
     queue<BiTreeNode*>q;
     BiTreeNode *p;
     p=Root;
     if(p!=NULL)
       q.push(p);
     while(!q.empty()){
        temp = q.front();         
        cout << temp->data << "  ";  
        q.pop();  
     if(temp->LeftChild!=NULL)
        q.push(temp->LeftChild);
     if(temp->RightChild!=NULL)
        q.push(temp->RightChild);
     }
}

Answer 2

你的 levelorder 里面好像没有 pop 操作吧，访问完一个节点之后应该将它出队，不然就是死循环了，队列永远不会空：

while(!q.empty()) {
    p = q.front(); // 首先获取队首元素
    cout << p->data;
    
    if(p->LeftChild != NULL)
        q.push(p->LeftChild);
    if(p->RightChild != NULL)
        q.push(p->RightChild);
    q.pop();  // 记得出队
 }

Answer 3