-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTreeNode.h
92 lines (79 loc) · 1.7 KB
/
TreeNode.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
88
89
90
91
92
template <class T>
class Node
{
private:
T data;
Node<T> *left;
Node<T> *right;
int height;
public:
Node(T data) : data(data)
{
left = nullptr;
right = nullptr;
height = 0;
}
Node()
{
left = nullptr;
right = nullptr;
height = 0;
}
int getBalanceFactor() { return getHeight(left) - getHeight(right); }
void setHeight(int height) { this->height = height; }
int getHeight() { return height; }
void updateHeight()
{
if (left == nullptr && right == nullptr)
{
height = 0;
}
else if (left == nullptr)
{
height = 1 + right->getHeight();
}
else if (right == nullptr)
{
height = 1 + left->getHeight();
}
else
{
if (left->getHeight() > right->getHeight())
{
height = 1 + left->getHeight();
}
else
{
height = 1 + right->getHeight();
}
}
}
int getHeight(Node<T> *node)
{
if (node == nullptr)
return -1;
return node->getHeight();
}
T getData() { return data; }
const T getData() const { return data; }
Node<T> *getLeft() { return left; }
Node<T> *getRight() { return right; }
void setData(T data) { this->data = data; }
void setLeft(Node *node)
{
left = node;
updateHeight();
}
void setRight(Node *node)
{
right = node;
updateHeight();
}
~Node()
{
if (left != nullptr)
delete left;
if (right != nullptr)
delete right;
}
};