Revering tree update (#6561)

* Add files via upload

* Add files via upload

* Add files via upload

* Add files via upload

* Add files via upload

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/reversingtree/TreeNode.java

@@ -30,7 +30,7 @@ public class TreeNode {
         this.leftChild = leftChild;
     }
 
-    public TreeNode(int value, TreeNode rightChild, TreeNode leftChild) {
+    public TreeNode(int value, TreeNode leftChild, TreeNode rightChild) {
         this.value = value;
         this.rightChild = rightChild;
         this.leftChild = leftChild;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/reversingtree/TreeReverser.java

@@ -4,21 +4,6 @@ import java.util.LinkedList;
 
 public class TreeReverser {
 
-    public TreeNode createBinaryTree() {
-
-        TreeNode leaf1 = new TreeNode(3);
-        TreeNode leaf2 = new TreeNode(1);
-        TreeNode leaf3 = new TreeNode(9);
-        TreeNode leaf4 = new TreeNode(6);
-
-        TreeNode nodeLeft = new TreeNode(2, leaf1, leaf2);
-        TreeNode nodeRight = new TreeNode(7, leaf3, leaf4);
-
-        TreeNode root = new TreeNode(4, nodeRight, nodeLeft);
-
-        return root;
-    }
-
     public void reverseRecursive(TreeNode treeNode) {
         if (treeNode == null) {
             return;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/reversingtree/TreeReverserUnitTest.java

@@ -10,7 +10,7 @@ public class TreeReverserUnitTest {
     public void givenTreeWhenReversingRecursivelyThenReversed() {
         TreeReverser reverser = new TreeReverser();
 
-        TreeNode treeNode = reverser.createBinaryTree();
+        TreeNode treeNode = createBinaryTree();
 
         reverser.reverseRecursive(treeNode);
 
@@ -22,7 +22,7 @@ public class TreeReverserUnitTest {
     public void givenTreeWhenReversingIterativelyThenReversed() {
         TreeReverser reverser = new TreeReverser();
 
-        TreeNode treeNode = reverser.createBinaryTree();
+        TreeNode treeNode = createBinaryTree();
 
         reverser.reverseIterative(treeNode);
 
@@ -30,4 +30,18 @@ public class TreeReverserUnitTest {
             .trim());
     }
 
+    private TreeNode createBinaryTree() {
+
+        TreeNode leaf1 = new TreeNode(1);
+        TreeNode leaf2 = new TreeNode(3);
+        TreeNode leaf3 = new TreeNode(6);
+        TreeNode leaf4 = new TreeNode(9);
+
+        TreeNode nodeRight = new TreeNode(7, leaf3, leaf4);
+        TreeNode nodeLeft = new TreeNode(2, leaf1, leaf2);
+
+        TreeNode root = new TreeNode(4, nodeLeft, nodeRight);
+
+        return root;
+    }
 }