用c写一个平衡二叉树的代码
时间: 2024-05-07 16:18:44 浏览: 14
以下是用 C 语言实现平衡二叉树的代码:
```
#include<stdio.h>
#include<stdlib.h>
struct Node {
int key;
struct Node *left;
struct Node *right;
int height;
};
int max(int a, int b) {
return (a > b) ? a : b;
}
int height(struct Node *node) {
if (node == NULL) {
return 0;
} else {
return node->height;
}
}
int getBalance(struct Node *node) {
if (node == NULL) {
return 0;
} else {
return height(node->left) - height(node->right);
}
}
struct Node *newNode(int key) {
struct Node *node = (struct Node *)malloc(sizeof(struct Node));
node->key = key;
node->left = NULL;
node->right = NULL;
node->height = 1;
return node;
}
struct Node *rightRotate(struct Node *y) {
struct Node *x = y->left;
struct Node *T2 = x->right;
x->right = y;
y->left = T2;
y->height = max(height(y->left), height(y->right)) + 1;
x->height = max(height(x->left), height(x->right)) + 1;
return x;
}
struct Node *leftRotate(struct Node *x) {
struct Node *y = x->right;
struct Node *T2 = y->left;
y->left = x;
x->right = T2;
x->height = max(height(x->left), height(x->right)) + 1;
y->height = max(height(y->left), height(y->right)) + 1;
return y;
}
struct Node *insert(struct Node *node, int key) {
if (node == NULL) {
return newNode(key);
}
if (key < node->key) {
node->left = insert(node->left, key);
} else if (key > node->key) {
node->right = insert(node->right, key);
} else {
return node;
}
node->height = 1 + max(height(node->left), height(node->right));
int balance = getBalance(node);
if (balance > 1 && key < node->left->key) {
return rightRotate(node);
}
if (balance < -1 && key > node->right->key) {
return leftRotate(node);
}
if (balance > 1 && key > node->left->key) {
node->left = leftRotate(node->left);
return rightRotate(node);
}
if (balance < -1 && key < node->right->key) {
node->right = rightRotate(node->right);
return leftRotate(node);
}
return node;
}
void preOrder(struct Node *root) {
if (root != NULL) {
printf("%d ", root->key);
preOrder(root->left);
preOrder(root->right);
}
}
int main() {
struct Node *root = NULL;
root = insert(root, 10);
root = insert(root, 20);
root = insert(root, 30);
root = insert(root, 40);
root = insert(root, 50);
root = insert(root, 25);
printf("Preorder traversal of the constructed AVL tree is \n");
preOrder(root);
return 0;
}
```
以上代码实现了一个简单的平衡二叉树,包括插入和旋转操作。您可以在 `main` 函数中添加更多的插入语句来测试平衡二叉树的功能。