blob: d498b8eeca8f3d77a26957226d8de9553d6ffff2 (
plain)
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
93
94
95
96
97
98
99
100
|
public class BinaryNode<T> implements BinaryNodeInterface<T>
{
private T data;
private BinaryNode<T> left;
private BinaryNode<T> right;
public BinaryNode(T dataPortion, BinaryNode<T> leftChild, BinaryNode<T> rightChild)
{
data = dataPortion;
left = leftChild;
right = rightChild;
}
public BinaryNode(T dataPortion)
{
this(dataPortion, null, null);
}
public BinaryNode()
{
this(null);
}
public T getData()
{
return data;
}
public void setData(T newData)
{
data = newData;
}
public BinaryNodeInterface<T> getLeftChild()
{
return left;
}
public BinaryNodeInterface<T> getRightChild()
{
return right;
}
public void setLeftChild(BinaryNodeInterface<T> leftChild)
{
left = (BinaryNode<T>) leftChild;
}
public void setRightChild(BinaryNodeInterface<T> rightChild)
{
right = (BinaryNode<T>) rightChild;
}
public boolean hasLeftChild()
{
return left != null;
}
public boolean hasRightChild()
{
return right != null;
}
public boolean isLeaf()
{
return left == null && right == null;
}
public int getNumberOfNodes()
{
int leftNumber = 0;
int rightNumber = 0;
if(left != null)
leftNumber = left.getNumberOfNodes();
if(right != null)
rightNumber = right.getNumberOfNodes();
return 1 + leftNumber + rightNumber;
}
public int getHeight()
{
return getHeight(this);
}
private int getHeight(BinaryNode<T> node)
{
int height = 0;
if(node != null)
{
height = 1 + Math.max(getHeight(node.left), getHeight(node.right));
}
return height;
}
}
|
