// 广度优先遍历 void levelOrderTraversal(Tree root) {
if (root == NULL) {
return;
}
// 创建队列,存储节点指针
Tree queue[100];
int front = 0, rear = 0;
queue[rear++] = root;
while (front != rear) {
// 队首元素出队并访问
Tree node = queue[front++];
printf("%18s %10ld% 5.0f\n", node->data.name,node->data.number,node->data.score);
// 将左右子节点入队
if (node->left != NULL) {
queue[rear++] = node->left;
}
if (node->right != NULL) {
queue[rear++] = node->right;
}
}
}




