void LevelorderTraversal(BinTree BT)
{
BinTree Q[100],p;
int front, rear;
front = rear = 0;
if (!BT)return;
Q[rear++] = BT;
while (front != rear)
{
p = Q[front++];
if (p->Left)Q[rear++] = p->Left;
if (p->Right)Q[rear++] = p->Right;
printf(" %c", p->Data);
}
}
但是这个申请的Q的空间很大,一直往后面走