代碼如下:

#include <iostream> using namespace std;template <typename T> struct AVLNode {typedef AVLNode<T> Node;AVLNode(const T &val = T()):_parent(nullptr),_left(nullptr),_right(nullptr),_val(nullptr),_bf(0){}Node *_parent;Node *_left;Node *_right;T _val;int _bf; };template<typename T> class AVLTreeNode { public:typedef AVLNode<T> Node;Node *LL_Rotate(Node *a){Node *b;b = a->_left;a->_left = b->_right;b->_right = a;a->_bf = b->_bf = 0;return b;}Node *RR_Rotate(Node *a){Node *b;b = a->_right;a->_right = b->_left;b->_left = a;a->_bf = b->_bf = 0;return b;}Node *LR_Rotate(Node *a){Node *b, *c;b = a->_left;c = b->_right;a->_left = c->_right;b->_right = c->_left;c->_left = b;c->_right = a;if (c->_bf == 1) {a->_bf = -1;b->_bf = 0;}else if (c->_bf == -1){a->_bf = 0;b->_bf = 1;}else{a->_bf = b->_bf = 0;}c->_bf = 0;return c;}Node *RL_Rotate(Node *a){Node *b, *c;b = a->_right;c = b->_left;a->_right = c->_left;b->_left = c->_right;c->_left = a;c->_right = b;if (c->_bf == 1){a->_bf = 0;b->_bf = -1;}else if (c->_bf == -1){a->_bf = 1;b->_bf = 0;}else{a->_bf = b->_bf = 0;}c->_bf = 0;return c;}void AVLInsert(Node *&pavlt, Node *s){Node *f, *a, *b, *p, *q;if (pavlt == nullptr)//沒有根結點，那么插入的結點s就當作根結點{pavlt = s;return;}a = pavlt;//指針a記錄離*s最近的平衡因子不為0的結點，f指向*a的父結點f = nullptr;p = pavlt;q = nullptr;while (p != nullptr){if (p->_val == s->_val) return;if (p->_bf != 0){a = p;f = q;}q = p;if (s->_val < p->_val) p = p->_left;else p = p->_right;}if (s->_val < q->_val) q->_left = s;else q->_right = s;p = a;while (p != s){if (s->_val < p->_val){p->_bf++;p = p->_left;}else{p->_bf--;p = p->_right;}}if (a->_bf > -2 && a->_bf < 2) return; //插入結點后，沒有破壞樹的平衡性if (a->_bf == 2){b = a->_left;if (b->_bf == 1) p = LL_Rotate(a);else p = LR_Rotate(a);}else{b = a->_right;if (b->_bf == 1) p = RL_Rotate(a);else p = RR_Rotate(a);}if (f == nullptr) pavlt = p;//原*a是AVL樹的根else if (f->_left == a) f->_left = p;else f->_right = p;}void CreateTree(){int n;cin >> n;for (int i = 0; i < n; i++){Node *s = new Node;cin > s->_val;AVLInsert(_root, s);}}void InOrderTree(){InOrder(_root);cout << endl;}private:Node *_root;void InOrder(Node *cur){if (cur){InOrder(cur->_left);cout << cur->_val << " ";InOrder(cur->_right);}} };

總結

以上是生活随笔為你收集整理的C++泛型编程实现平衡二叉搜索树AVL的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。