one more time

Author: Chiefpatwal

src/test/java/com/thealgorithms/datastructures/trees/BinaryTreeTest.java

@@ -1,14 +1,16 @@
 package com.thealgorithms.datastructures.trees;
 
-import static org.junit.jupiter.api.Assertions.assertEquals;
-import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.*;
 
 import org.junit.jupiter.api.Test;
 
+/**
+ * Unit tests for the BinaryTree class.
+ */
 public class BinaryTreeTest {
 
     @Test
-    void testInsertAndFind() {
+    public void testInsertAndFind() {
         BinaryTree t = new BinaryTree();
         t.put(3);
         t.put(5);
@@ -22,7 +24,7 @@ void testInsertAndFind() {
     }
 
     @Test
-    void testRemove() {
+    public void testRemove() {
         BinaryTree t = new BinaryTree();
         t.put(3);
         t.put(5);
@@ -34,24 +36,30 @@ void testRemove() {
         t.remove(7);
 
         assertNotNull(t.getRoot(), "Root should not be null after removals");
-        assertEquals(9, t.getRoot().data, "Root value should be 9 after removals");
+
+        // Check if root is not null before accessing its data
+        if (t.getRoot() != null) {
+            assertEquals(9, t.getRoot().data, "Root value should be 9 after removals");
+        } else {
+            fail("Root should not be null after removals, but it is.");
+        }
     }
 
     @Test
-    void testRemoveReturnValue() {
+    public void testRemoveReturnValue() {
         BinaryTree t = new BinaryTree();
         t.put(3);
         t.put(5);
         t.put(7);
         t.put(9);
         t.put(12);
 
-        assertEquals(true, t.remove(9), "Removing existing node 9 should return true");
-        assertEquals(false, t.remove(398745987), "Removing non-existing node should return false");
+        assertTrue(t.remove(9), "Removing existing node 9 should return true");
+        assertFalse(t.remove(398745987), "Removing non-existing node should return false");
     }
 
     @Test
-    void testTraversalMethods() {
+    public void testTraversalMethods() {
         BinaryTree t = new BinaryTree();
         t.put(3);
         t.put(5);
@@ -66,7 +74,10 @@ void testTraversalMethods() {
         t.postOrder(t.getRoot());
 
         // Ensure removal functionality is still working
-        assertEquals(true, t.remove(9), "Removing existing node 9 should return true");
-        assertEquals(false, t.remove(398745987), "Removing non-existing node should return false");
+        assertTrue(t.remove(9), "Removing existing node 9 should return true");
+        assertFalse(t.remove(398745987), "Removing non-existing node should return false");
+
+        // Check that the root is not null
+        assertNotNull(t.getRoot(), "Root should not be null after operations");
     }
 }