用C语言写一个二叉树
时间: 2023-02-19 11:57:29 浏览: 56
下面是一个使用 C 语言实现二叉树的示例代码:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct TreeNode {
int data;
struct TreeNode *left;
struct TreeNode *right;
} TreeNode;
TreeNode* createTreeNode(int data) {
TreeNode* newNode = (TreeNode*)malloc(sizeof(TreeNode));
newNode->data = data;
newNode->left = NULL;
newNode->right = NULL;
return newNode;
}
TreeNode* insert(TreeNode* root, int data) {
if (root == NULL) {
root = createTreeNode(data);
} else if (data <= root->data) {
root->left = insert(root->left, data);
} else {
root->right = insert(root->right, data);
}
return root;
}
void inOrderTraverse(TreeNode* root) {
if (root == NULL) return;
inOrderTraverse(root->left);
printf("%d ", root->data);
inOrderTraverse(root->right);
}
void preOrderTraverse(TreeNode* root) {
if (root == NULL) return;
printf("%d ", root->data);
preOrderTraverse(root->left);
preOrderTraverse(root->right);
}
void postOrderTraverse(TreeNode* root) {
if (root == NULL) return;
postOrderTraverse(root->left);
postOrderTraverse(root->right);
printf("%d ", root->data);
}
int main() {
TreeNode* root = NULL;
root = insert(root, 5);
root = insert(root, 3);
root = insert(root, 7);
root = insert(root, 2);
root = insert(root, 4);
root = insert(root, 6);
root = insert(root, 8);
printf("In-order Traversal: ");
inOrderTraverse(root);
printf("\nPre-order Traversal: ");
preOrderTraverse(root);
printf("\nPost-order Traversal: ");
postOrderTraverse(root);
return 0;
}
```
该代码中使用了递归的方式实现了二叉树的中序遍历,先序遍历和后序遍历。
请注意,这个代码供学习用,并不是一个完整的二叉树操作库。