#include <stdio.h>
#include <stdlib.h>
#pragma warning (disable:4996)
// Define the TreeNode structure
typedef struct TreeNode {
int value;
struct TreeNode* left;
struct TreeNode* right;
} TreeNode;
// Define a Queue structure for level-order traversal
typedef struct QueueNode {
TreeNode* treenode;
struct QueueNode* next;
} QueueNode;
typedef struct {
QueueNode* front;
QueueNode* rear;
} Queue;
// Function to create a new TreeNode
TreeNode* newTreeNode(int value) {
if (value == -1) {
return NULL;
}
TreeNode* node = (TreeNode*)malloc(sizeof(TreeNode));
node->value = value;
node->left = node->right = NULL;
return node;
}
// Queue functions
Queue* createQueue() {
Queue* queue = (Queue*)malloc(sizeof(Queue));
queue->front = queue->rear = NULL;
return queue;
}
void enqueue(Queue* queue, TreeNode* node) {
QueueNode* newNode = (QueueNode*)malloc(sizeof(QueueNode));
newNode->treenode = node;
newNode->next = NULL;
if (queue->rear == NULL) {
queue->front = queue->rear = newNode;
return;
}
queue->rear->next = newNode;
queue->rear = newNode;
}
TreeNode* dequeue(Queue* queue) {
if (queue->front == NULL) {
return NULL;
}
QueueNode* temp = queue->front;
TreeNode* node = temp->treenode;
queue->front = queue->front->next;
if (queue->front == NULL) {
queue->rear = NULL;
}
free(temp);
return node;
}
int isEmpty(Queue* queue) {
return queue->front == NULL;
}
// Function to build the binary tree
TreeNode* buildTree(int nodes[], int size) {
if (size == 0) return NULL;
TreeNode** tree = (TreeNode**)malloc(size * sizeof(TreeNode*));
for (int i = 0; i < size; i++) {
tree[i] = newTreeNode(nodes[i]);
}
Queue* queue = createQueue();
int nextNode = 1;
for (int i = 0; i < size; i++) {
if (tree[i] != NULL) {
if (nextNode < size && tree[nextNode] != NULL) {
tree[i]->left = tree[nextNode++];
}
else {
nextNode++;
}
if (nextNode < size && tree[nextNode] != NULL) {
tree[i]->right = tree[nextNode++];
}
else {
nextNode++;
}
enqueue(queue, tree[i]);
}
}
TreeNode* root = tree[0];
free(tree);
free(queue);
return root;
}
// Function to perform level order traversal
void levelOrderTraversal(TreeNode* root) {
if (root == NULL) return;
Queue* queue = createQueue();
enqueue(queue, root);
while (!isEmpty(queue)) {
int levelSize = 0;
Queue* tempQueue = createQueue();
while (!isEmpty(queue)) {
TreeNode* current = dequeue(queue);
if (levelSize++ > 0) printf(" ");
printf("%d", current->value);
if (current->left) enqueue(tempQueue, current->left);
if (current->right) enqueue(tempQueue, current->right);
}
free(queue);
queue = tempQueue;
if (!isEmpty(queue)) printf(" ,");
}
free(queue);
}
int main() {
int n;
//printf("Enter number of nodes: ");
scanf("%d", &n);
int* nodes = (int*)malloc(n * sizeof(int));
//printf("Enter the node values (-1 for NULL): ");
for (int i = 0; i < n; i++) {
scanf("%d", &nodes[i]);
}
TreeNode* root = buildTree(nodes, n);
levelOrderTraversal(root);
free(nodes);
printf("\n");
return 0;
}
content_1717678800466.zip （25个子文件） 
7413_查找和排序 
131_升序排序，奇数在偶数之前（C++）.cpp 2KB 731_2024春 找出数组中的第K个最大数.cpp 1KB 333_习题9-3-5录取成绩.cpp 868B 736_2024春 创建二叉排序树.cpp 2KB 737_2024春 LRU页面置换算法.cpp 2KB 189_C4-1_折半查找.cpp 1KB 7334_链表 713_单链表排序和合并.cpp 1KB 711_两数之和 - 有序数组.cpp 756B 586_建立单链表.cpp 790B 110_4.7 学生管理系统.cpp 3KB 710_删除有序数组中的重复项.cpp 709B 712_带头节点的单链表并判断链表中是否有环.cpp 931B 7412_树和二叉树 727_二叉树的层序遍历.cpp 4KB 76_复原二叉树.cpp 2KB 536_构造二叉树.cpp 2KB 714_二叉树的最大深度.cpp 2KB 537_图的深度优先遍历.cpp 3KB 733_平衡二叉树.cpp 2KB 728_求根节点到叶节点数字之和.cpp 2KB 7335_栈和队列 735_比较含退格的字符串.cpp 967B 732_计算无法吃午餐的学生数量.cpp 587B 133_矩阵乘法（C++）.cpp 478B 734_买票需要的时间.cpp 684B 534_约瑟夫生死游戏.cpp 2KB 719_括号匹配问题.cpp 1004B资源评论
