-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSplaytree.h
87 lines (68 loc) · 1.76 KB
/
Splaytree.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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#ifndef TERM_PROJECT_SPLAYTREE_H
#define TERM_PROJECT_SPLAYTREE_H
class Node{
public:
int data;
Node* left;
Node* right;
Node* parent;
void setLeftChild(Node* child){
left = child;
if(child != nullptr){
child -> parent = this;
}
}
void setRightChild(Node* child){
right = child;
if(child != nullptr){
child -> parent = this;
}
}
bool isLeftChild(){
if(parent == nullptr){
return false;
}
else{
return parent -> left == this;
}
}
bool isRightChild(){
if(parent == nullptr){
return false;
}
else{
return parent -> right == this;
}
}
bool isRoot(){
return parent == nullptr;
}
//Constructor
Node(int d, Node* p){
data = d;
left = nullptr;
right = nullptr;
parent = p;
}
};
class Splaytree {
private:
Node* root = nullptr;
void bringToTop(Node* x);
void zig(Node* x, Node* p, Node* g);
void zag(Node* x, Node* p, Node* g);
void zigZag(Node* x, Node* p, Node* g);
void zagZig(Node* x, Node* p, Node* g);
void zigZig(Node* x, Node* p, Node* g);
void zagZag(Node* x, Node* p, Node* g);
public:
Splaytree();
~Splaytree();
void clear(Node* curr);
void insert(int data);
bool search(int data);
void inOrder();
void inOrder(Node* curr);
void levelOrder();
};
#endif //TERM_PROJECT_SPLAYTREE_H