updated the test values

Author: Krishnan M

src/main/java/com/thealgorithms/tree/BinarySearchTree.java

@@ -29,6 +29,8 @@ public Node(int value) {
         public int getValue() {
             return value;
         }
+ 
+
     }
 
     private Node root;
@@ -43,6 +45,14 @@ public BinarySearchTree() {
     public int height(Node node) {
         return node == null ? -1 : node.height;
     }
+    
+    /**
+     * Returns the root node of the BST.
+     * Used for testing and internal inspection.
+     */
+    public Node getRoot() {
+        return root;
+    }
 
     /**
      * Checks if the BST is empty.

src/test/java/com/thealgorithms/tree/BinarySearchTree.java

@@ -71,6 +71,17 @@ void testPreOrderTraversal() {
         assertTrue(true, "Preorder traversal executed successfully");
     }
 
+    /**
+     * Tests the height of the root node after inserting multiple values into the BST.
+     * Ensures the height is calculated correctly for a balanced tree.
+     */
+    @Test
+    void testRootHeightAfterInsertions() {
+        bst.populate(new int[]{30, 20, 40, 10, 25, 35, 50});
+        int expectedHeight = 2; // Based on balanced tree structure
+        assertEquals(expectedHeight, bst.height(bst.getRoot()), "Height of root node should be 2");
+    }
+
     /**
      * Tests postorder traversal output.
      */