平衡二叉排序树c语言实现
时间: 2023-12-03 15:40:45 浏览: 35
平衡二叉排序树(AVL树)是一种自平衡的二叉排序树,它的左右子树的高度差不超过1。下面是平衡二叉排序树的C语言实现:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct AVLNode {
int data;
int height;
struct AVLNode *left;
struct AVLNode *right;
} AVLNode;
int max(int a, int b) {
return a > b ? a : b;
}
int getHeight(AVLNode *node) {
if (node == NULL) {
return 0;
}
return node->height;
}
int getBalanceFactor(AVLNode *node) {
if (node == NULL) {
return 0;
}
return getHeight(node->left) - getHeight(node->right);
}
AVLNode *createNode(int data) {
AVLNode *node = (AVLNode *)malloc(sizeof(AVLNode));
node->data = data;
node->height = 1;
node->left = NULL;
node->right = NULL; return node;
}
AVLNode *leftRotate(AVLNode *node) {
AVLNode *newRoot = node->right;
AVLNode *temp = newRoot->left;
newRoot->left = node;
node->right = temp;
node->height = max(getHeight(node->left), getHeight(node->right)) + 1;
newRoot->height = max(getHeight(newRoot->left), getHeight(newRoot->right)) + 1;
return newRoot;
}
AVLNode *rightRotate(AVLNode *node) {
AVLNode *newRoot = node->left;
AVLNode *temp = newRoot->right;
newRoot->right = node;
node->left = temp;
node->height = max(getHeight(node->left), getHeight(node->right)) + 1;
newRoot->height = max(getHeight(newRoot->left), getHeight(newRoot->right)) + 1;
return newRoot;
}
AVLNode *insert(AVLNode *node, int data) {
if (node == NULL) {
return createNode(data);
}
if (data < node->data) {
node->left = insert(node->left, data);
} else if (data > node->data) {
node->right = insert(node->right, data);
} else {
return node;
}
node->height = max(getHeight(node->left), getHeight(node->right)) + 1;
int balanceFactor = getBalanceFactor(node);
if (balanceFactor > 1 && data < node->left->data) {
return rightRotate(node);
}
if (balanceFactor < -1 && data > node->right->data) {
return leftRotate(node);
}
if (balanceFactor > 1 && data > node->left->data) {
node->left = leftRotate(node->left);
return rightRotate(node);
}
if (balanceFactor < -1 && data < node->right->data) {
node->right = rightRotate(node->right);
return leftRotate(node);
}
return node;
}
void preOrder(AVLNode *node) {
if (node != NULL) {
printf("%d ", node->data);
preOrder(node->left);
preOrder(node->right);
}
}
int main() {
AVLNode *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;
}
```