- 按层次来遍历数据结构
- 借助队列的性质
- 树节点队列参考
bool TreeFloorTraverse(BiTree *biTree) {
QueueTree Q;
BiTree *middle;
if (!biTree) {
return false;
}
Q = InitQueueTree(20);
middle = biTree;
ENQueueTree(&Q, middle);
while (Q.tag != 0) {
DEQueueTree(&Q, &middle);
putchar(middle->data);
if (middle->leftChild) ENQueueTree(&Q, middle->leftChild);
if (middle->rightChild) ENQueueTree(&Q, middle->rightChild);
}
return true;
}