创建完全二叉树C语言
时间: 2023-12-12 21:32:57 浏览: 42
以下是创建完全二叉树的C语言代码示例:
```c
#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 100
typedef struct TreeNode {
int data;
struct TreeNode *left; struct TreeNode *right;
} TreeNode;
typedef struct Queue {
TreeNode *data[MAX_SIZE];
int front, rear;
} Queue;
Queue *createQueue() {
Queue *queue = (Queue *)malloc(sizeof(Queue));
queue->front = queue->rear = 0;
return queue;
}
void enqueue(Queue *queue, TreeNode *node) {
if ((queue->rear + 1) % MAX_SIZE == queue->front) {
printf("Queue is full.\n");
return;
}
queue->data[queue->rear] = node;
queue->rear = (queue->rear + 1) % MAX_SIZE;
}
TreeNode *dequeue(Queue *queue) {
if (queue->front == queue->rear) {
printf("Queue is empty.\n");
return NULL;
}
TreeNode *node = queue->data[queue->front];
queue->front = (queue->front + 1) % MAX_SIZE;
return node;
}
TreeNode *createTree(int arr[], int size, int index) {
if (index >= size) {
return NULL;
}
TreeNode *node = (TreeNode *)malloc(sizeof(TreeNode));
node->data = arr[index];
node->left = createTree(arr, size, 2 * index + 1);
node->right = createTree(arr, size, 2 * index + 2);
return node;
}
void levelOrderTraversal(TreeNode *root) {
if (root == NULL) {
return;
}
Queue *queue = createQueue();
enqueue(queue, root);
while (queue->front != queue->rear) {
TreeNode *node = dequeue(queue);
printf("%d ", node->data);
if (node->left != NULL) {
enqueue(queue, node->left);
}
if (node->right != NULL) {
enqueue(queue, node->right);
}
}
}
int main() {
int arr[] = {1, 2, 3, 4, 5, 6, 7};
int size = sizeof(arr) / sizeof(arr[0]);
TreeNode *root = createTree(arr, size, 0);
printf("Level order traversal of the created binary tree is: ");
levelOrderTraversal(root);
return 0;
}
```