平衡二叉树(代码)

#include<stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct TreeNode
{
   
	int data;
	struct TreeNode* left;
	struct TreeNode* right;
}TreeNode;

TreeNode* create_node(int data)
{
   
	TreeNode* node = malloc(sizeof(TreeNode));
	node->data = data;
	node->left = NULL;
	node->right = NULL;
	return node;
}

//  求高度
int high_tree(TreeNode* root)
{
   
	if(NULL == root)	return 0;
	int lh = high_tree(root->left);
	int rh = high_tree(root->right);
	return lh>rh ? lh+1 : rh+1;
}

//  检查左右子树高度差
int is_avl(TreeNode* root)
{
   
	return high_tree(root->left) - high_tree(root->right);	
}

//  左旋转
TreeNode* left_rotate(TreeNode* x)
{
   
	TreeNode* y = x->right;
	TreeNode* t2 = y->left;

	y->left