写在前面:
平衡二叉树的学习是比较需要时间理解的。
关于平衡二叉树的基本概念,下面这篇博客是我觉得写的比较细致的,适合新手学习:
平衡二叉树详解 通俗易懂_邓嘉文Jarvan的博客-CSDN博客_二叉平衡树
本篇博客主要分享一下C++实现平衡二叉树的插入操作,并遍历出来:
完整代码:
#include<iostream>
using namespace std;
typedef struct Node {
int data;
int height;//当前节点的高度;
struct Node* left;
struct Node* right;
}Node;
//比较大小
int max(int a, int b)
{
return a > b ? a : b;
}
//计算树的高度
int height(Node *root)
{
if (root == NULL)
{
return 0;
}
return 1 + max(height(root->left), height(root->right));
}
//创建新结点
Node* newNode(int key)
{
Node* node = new Node;
node->data = key;
node->left = NULL;
node->right = NULL;
return node;
}
//获得平衡因子
int getBalanceFactor(Node* node)
{
if (node == NULL)
return 0;
return height(node->left) - height(node->right);
}
//右旋转
Node* rightRotate(Node* y)
{
Node* x = y->left;
Node* xr = x->right;
x->right = y;
y->left = xr;
x->height = height(x);
y->height = height(y);
return x;
}
//左旋转
Node* leftRotate(Node *y)
{
Node* x = y->right;
Node* xl = x->left;
x->left = y;
y->right = xl;
x->height = height(x);
y->height = height(y);
return x;
}
//往根节点为Node的树中插入值为key的元素,返回Node *新的根节点
Node* insert(Node* node, int key)
{
if (node == NULL) return newNode(key);
if (key < node->data) node->left = insert(node->left, key);
if (key > node->data) node->right = insert(node->right, key);
else return node; //值已存在
node->height = height(node); //更新插入路径上每颗子树的高度
int bf = getBalanceFactor(node); //计算平衡因子,不平衡则需要调整
//LL型不平衡
if (bf < -1 && key > node->right->data) return leftRotate(node);
//RR型不平衡
if (bf > 1 && key < node->left->data) return rightRotate(node);
//LR型不平衡
if (bf > 1 && key > node->left->data)
{
node->left = leftRotate(node->left);
return rightRotate(node);
}
//RL型不平衡
if (bf < -1 && key < node->right->data)
{
node->right = rightRotate(node->right);
return leftRotate(node);
}
return node; //如果是平衡的直接返回根节点
}
void preorder(Node* root)
{
if (root != NULL)
{
cout << root->data << " ";
preorder(root->left);
preorder(root->right);
}
}
int main() {
Node* root = NULL;
root = insert(root, 1);
root = insert(root, 2);
root = insert(root, 3);
root = insert(root, 4);
root = insert(root, 5);
root = insert(root, 6);
root = insert(root, 7);
preorder(root);
return 0;
}
执行结果: