@@ -41,7 +41,7 @@ public HeapSort(int[] input, boolean maxHeap) {
41
41
protocol .add (new HeapStep (root , new ArrayList <>(), heapifyStartPosition ));
42
42
}
43
43
44
- public void heapify (TreeNode <HeapSortNodeValue > elementToHeapify ) {
44
+ private void heapify (TreeNode <HeapSortNodeValue > elementToHeapify ) {
45
45
List <TreeNode <HeapSortNodeValue >> children = elementToHeapify .getChildren ();
46
46
Collections .sort (children , new HeapNodeComparator ());
47
47
int valueElement = elementToHeapify .getValue ().getNumber ();
@@ -57,8 +57,8 @@ public void heapify(TreeNode<HeapSortNodeValue> elementToHeapify) {
57
57
doSwap = valueChild < valueElement ;
58
58
}
59
59
if (doSwap ) {
60
- elementToHeapify .getValue ().setNumber (valueChild );
61
- children .get (0 ).getValue ().setNumber (valueElement );
60
+ elementToHeapify .getValue ().replaceNumber (valueChild );
61
+ children .get (0 ).getValue ().replaceNumber (valueElement );
62
62
heapify (children .get (0 ));
63
63
}
64
64
}
@@ -115,14 +115,14 @@ public boolean doStep() {
115
115
return stepDone ;
116
116
}
117
117
118
- public TreeNode <HeapSortNodeValue > createNewTree (TreeNode <HeapSortNodeValue > oldTree ) {
118
+ private TreeNode <HeapSortNodeValue > createNewTree (TreeNode <HeapSortNodeValue > oldTree ) {
119
119
TreeNode <HeapSortNodeValue > newTree =
120
120
new TreeNode <>(new HeapSortNodeValue (oldTree .getValue ().getNumber ()));
121
121
copyChildren (newTree , oldTree );
122
122
return newTree ;
123
123
}
124
124
125
- public void copyChildren (
125
+ private void copyChildren (
126
126
TreeNode <HeapSortNodeValue > newTreeNode , TreeNode <HeapSortNodeValue > oldTreeNode ) {
127
127
for (TreeNode <HeapSortNodeValue > oldChild : oldTreeNode .getChildren ()) {
128
128
TreeNode <HeapSortNodeValue > newChild =
0 commit comments