updated

Author: Krishnan M

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

@@ -29,6 +29,19 @@ public Node(int value) {
         public int getValue() {
             return value;
         }
+        
+        public Node getLeft() {
+            return left;
+        }
+        
+        public Node getRight() {
+            return right;
+        }
+        
+        public int getHeight() {
+            return height;
+        }
+        
 
 
     }

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

@@ -43,6 +43,34 @@ void testRootHeight() {
         assertEquals(expectedHeight, bst.height(bst.getRoot()), "Height of root node should be 2");
     }
 
+    /**
+     * Tests the populateSorted method to ensure the BST is balanced
+     * when populated with a sorted array.
+     */
+    @Test
+    public void testPopulateSortedAndBalanced() {
+        BinarySearchTree bst = new BinarySearchTree();
+        int[] sortedArray = {1, 2, 3, 4, 5, 6, 7};
+        bst.populateSorted(sortedArray);
+        assertTrue(bst.balanced());
+    }
+
+    /**
+     * Unit test for verifying the height calculation of nodes in the BinarySearchTree.
+     * This test inserts three nodes and checks the height of the left child of the root.
+     */
+    @Test
+    public void testHeightCalculation() {
+        BinarySearchTree bst = new BinarySearchTree();
+        bst.insert(10);  // Root
+        bst.insert(5);   // Left child
+        bst.insert(15);  // Right child
+
+        // Verify height of left child of root
+        assertEquals(0, bst.height(bst.getRoot().getLeft()));
+    }
+
+    
 
     /**
      * Tests if the BST is balanced.