refactor

marcos-lg · marcos-lg · commit 959845621fc2 · 2017-12-16T12:37:30.000+01:00
diff --git a/core-java/src/main/java/com/baeldung/tree/BinaryTree.java b/core-java/src/main/java/com/baeldung/tree/BinaryTree.java
@@ -82,7 +82,7 @@ private Node deleteRecursive(Node current, int value) {
             }
 
             // Case 3: 2 children
-            int smallestValue = findSmallestNode(current.right);
+            int smallestValue = findSmallestValue(current.right);
             current.value = smallestValue;
             current.right = deleteRecursive(current.right, smallestValue);
             return current;
@@ -96,13 +96,13 @@ private Node deleteRecursive(Node current, int value) {
         }
     }
 
-    private int findSmallestNode(Node root) {
+    private int findSmallestValue(Node root) {
 
         if (root.left == null) {
             return root.value;
         }
 
-        return findSmallestNode(root.left);
+        return findSmallestValue(root.left);
     }
 
     public void traverseInOrder(Node node) {

Original file line number	Diff line number	Diff line change
`@@ -82,7 +82,7 @@ private Node deleteRecursive(Node current, int value) {`
`82`	`82`	`}`
`83`	`83`
`84`	`84`	`// Case 3: 2 children`
`85`		`- int smallestValue = findSmallestNode(current.right);`
	`85`	`+ int smallestValue = findSmallestValue(current.right);`
`86`	`86`	`current.value = smallestValue;`
`87`	`87`	`current.right = deleteRecursive(current.right, smallestValue);`
`88`	`88`	`return current;`
`@@ -96,13 +96,13 @@ private Node deleteRecursive(Node current, int value) {`
`96`	`96`	`}`
`97`	`97`	`}`
`98`	`98`
`99`		`- private int findSmallestNode(Node root) {`
	`99`	`+ private int findSmallestValue(Node root) {`
`100`	`100`
`101`	`101`	`if (root.left == null) {`
`102`	`102`	`return root.value;`
`103`	`103`	`}`
`104`	`104`
`105`		`- return findSmallestNode(root.left);`
	`105`	`+ return findSmallestValue(root.left);`
`106`	`106`	`}`
`107`	`107`
`108`	`108`	`public void traverseInOrder(Node node) {`