-
Notifications
You must be signed in to change notification settings - Fork 17
/
RedBlackTree.h
59 lines (51 loc) · 1.29 KB
/
RedBlackTree.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
// Copyright [2017] <MaoMao>
#ifndef _RED_BALCK_TREE_HPP_
#define _RED_BALCK_TREE_HPP_
#include "ICollection.h"
#include <stdint.h>
enum RBTreeColor
{
BLACK = 0,
RED = 1
};
struct RedBlackTreeNode : public Element
{
RBTreeColor color;
RedBlackTreeNode* p;
RedBlackTreeNode* left;
RedBlackTreeNode* right;
RedBlackTreeNode()
{
color = RED;
p = nullptr;
left = nullptr;
right = nullptr;
}
};
class RedBlackTree : public IAdvancedCollection
{
public:
RedBlackTree();
virtual ~RedBlackTree();
public:
// Return null if not found
virtual Element* Search(int key);
virtual void Insert(Element* elm);
virtual void Delete(Element* elm);
virtual Element* Minimum();
virtual Element* Maximum();
virtual Element* Successor(Element* elm);
virtual Element* Predecessor(Element* elm);
private:
RedBlackTreeNode* MinimumSubTree(RedBlackTreeNode* r);
Element* MaximumSubTree(RedBlackTreeNode* r);
void Transplant(RedBlackTreeNode* from, RedBlackTreeNode* to);
void LeftRotate(RedBlackTreeNode* x);
void RightRotate(RedBlackTreeNode* y);
void InsertFixup(RedBlackTreeNode* z);
void DeleteFixup(RedBlackTreeNode* x);
public:
RedBlackTreeNode* root;
RedBlackTreeNode* nil;
};
#endif