C语言实现根据key值插入语二叉树
时间: 2024-05-09 08:19:52 浏览: 11
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct TreeNode {
int key;
struct TreeNode *left;
struct TreeNode *right;
} TreeNode;
TreeNode *insert(TreeNode *root, int key) {
if (root == NULL) {
TreeNode *new_node = (TreeNode*)malloc(sizeof(TreeNode));
new_node->key = key;
new_node->left = NULL;
new_node->right = NULL;
return new_node;
}
if (key < root->key) {
root->left = insert(root->left, key);
} else if (key > root->key) {
root->right = insert(root->right, key);
}
return root;
}
void inorder_traversal(TreeNode *root) {
if (root != NULL) {
inorder_traversal(root->left);
printf("%d ", root->key);
inorder_traversal(root->right);
}
}
int main() {
TreeNode *root = NULL;
root = insert(root, 4);
insert(root, 2);
insert(root, 6);
insert(root, 1);
insert(root, 3);
insert(root, 5);
insert(root, 7);
inorder_traversal(root);
printf("\n");
return 0;
}
```