平衡二叉树（LL，RR，LR，RL）简易例程

LL型

struct TreeNode *SingleRotateWithLeft(struct TreeNode* root){
	struct TreeNode *Node;
	Node=root->left;
	root->left=Node->right;
	Node->right=root;
	return Node;	//返回根节点
}	

RR型

struct TreeNode *SingleRotateWithRight(struct TreeNode* root){
	struct TreeNode *Node;
	Node=root->right;
	root->right=Node->left;
	Node->left=root;
	return Node;	//返回根节点
}	

LR型

struct TreeNode *DoubleRotateWithLeft(struct TreeNode* root){
	root->left=SingleRotateWithRight(root->left);
	return SingleRotateWithLeft(root);	//可以看到双旋转实际与单旋转并没有本质上的区别
}	

RL型

struct TreeNode *DoubleRotateWithRight(struct TreeNode* root){
	root->right=SingleRotateWithLeft(root->right);
	return SingleRotateWithRight(root);	//如上
}