BAEL-4864: Fix traverseInOrderWithoutRecursion method (#10588)

Co-authored-by: Krzysztof Woyke <krzysztof.woyke.sp@lhsystems.com>

data-structures/src/main/java/com/baeldung/tree/BinaryTree.java

@@ -148,48 +148,46 @@ public class BinaryTree {
         }
     }
 
-    
     public void traverseInOrderWithoutRecursion() {
-        Stack<Node> stack = new Stack<Node>();
+        Stack<Node> stack = new Stack<>();
         Node current = root;
-        stack.push(root);
+
-        while(! stack.isEmpty()) {
+        while (current != null || !stack.isEmpty()) {
-            while(current.left != null) {
+            while (current != null) {
+                stack.push(current);
                 current = current.left;
-                stack.push(current);                
-            }
-            current = stack.pop();
-            visit(current.value);
-            if(current.right != null) {
-                current = current.right;                
-                stack.push(current);
             }
+
+            Node top = stack.pop();
+            visit(top.value);
+            current = top.right;
         }
     }
 
     public void traversePreOrderWithoutRecursion() {
-        Stack<Node> stack = new Stack<Node>();
+        Stack<Node> stack = new Stack<>();
         Node current = root;
         stack.push(root);
-        while(! stack.isEmpty()) {
+
+        while (current != null && !stack.isEmpty()) {
             current = stack.pop();
             visit(current.value);
 
-            if(current.right != null)
+            if (current.right != null)
                 stack.push(current.right);
 
-            if(current.left != null)
+            if (current.left != null)
                 stack.push(current.left);
         }
     }
     
     public void traversePostOrderWithoutRecursion() {
-        Stack<Node> stack = new Stack<Node>();
+        Stack<Node> stack = new Stack<>();
         Node prev = root;
         Node current = root;
         stack.push(root);
 
-        while (!stack.isEmpty()) {
+        while (current != null && !stack.isEmpty()) {
             current = stack.peek();
             boolean hasChild = (current.left != null || current.right != null);
             boolean isPrevLastChild = (prev == current.right || (prev == current.left && current.right == null));

data-structures/src/test/java/com/baeldung/tree/BinaryTreeUnitTest.java

@@ -13,7 +13,7 @@ public class BinaryTreeUnitTest {
 
         BinaryTree bt = createBinaryTree();
 
-        assertTrue(!bt.isEmpty());
+        assertFalse(bt.isEmpty());
     }
 
     @Test
@@ -72,6 +72,7 @@ public class BinaryTreeUnitTest {
 
     @Test
     public void it_deletes_the_root() {
+
         int value = 12;
         BinaryTree bt = new BinaryTree();
         bt.add(value);
@@ -91,6 +92,14 @@ public class BinaryTreeUnitTest {
         bt.traverseInOrderWithoutRecursion();
     }
 
+    @Test
+    public void givenAnEmptyBinaryTree_WhenTraversingInOrderWithoutRecursion_ThenNoException() {
+
+        BinaryTree empty = new BinaryTree();
+
+        empty.traverseInOrderWithoutRecursion();
+    }
+
     @Test
     public void givenABinaryTree_WhenTraversingPreOrder_ThenPrintValues() {
 
@@ -101,6 +110,14 @@ public class BinaryTreeUnitTest {
         bt.traversePreOrderWithoutRecursion();
     }
 
+    @Test
+    public void givenAnEmptyBinaryTree_WhenTraversingPreOrderWithoutRecursion_ThenNoException() {
+
+        BinaryTree empty = new BinaryTree();
+
+        empty.traversePreOrderWithoutRecursion();
+    }
+
     @Test
     public void givenABinaryTree_WhenTraversingPostOrder_ThenPrintValues() {
 
@@ -111,6 +128,14 @@ public class BinaryTreeUnitTest {
         bt.traversePostOrderWithoutRecursion();
     }
 
+    @Test
+    public void givenAnEmptyBinaryTree_WhenTraversingPostOrderWithoutRecursion_ThenNoException() {
+
+        BinaryTree empty = new BinaryTree();
+
+        empty.traversePostOrderWithoutRecursion();
+    }
+
     @Test
     public void givenABinaryTree_WhenTraversingLevelOrder_ThenPrintValues() {