Delete the root element from the tree.

Imre Balassa · Imre Balassa · commit 76d17d75a8fe · 2018-07-07T01:38:35.000+02:00
diff --git a/data-structures/src/main/java/com/baeldung/tree/BinaryTree.java b/data-structures/src/main/java/com/baeldung/tree/BinaryTree.java
@@ -57,7 +57,7 @@ private boolean containsNodeRecursive(Node current, int value) {
     }
 
     public void delete(int value) {
-        deleteRecursive(root, value);
+        root = deleteRecursive(root, value);
     }
 
     private Node deleteRecursive(Node current, int value) {
diff --git a/data-structures/src/test/java/com/baeldung/tree/BinaryTreeUnitTest.java b/data-structures/src/test/java/com/baeldung/tree/BinaryTreeUnitTest.java
@@ -6,7 +6,7 @@
 
 import org.junit.Test;
 
-public class BinaryTreeTest {
+public class BinaryTreeUnitTest {
 
     @Test
     public void givenABinaryTree_WhenAddingElements_ThenTreeNotEmpty() {
@@ -70,6 +70,17 @@ public void givenABinaryTree_WhenDeletingNonExistingElement_ThenTreeDoesNotDelet
         assertEquals(initialSize, bt.getSize());
     }
 
+    @Test
+    public void it_deletes_the_root() {
+        int value = 12;
+        BinaryTree bt = new BinaryTree();
+        bt.add(value);
+
+        assertTrue(bt.containsNode(value));
+        bt.delete(value);
+        assertFalse(bt.containsNode(value));
+    }
+
     @Test
     public void givenABinaryTree_WhenTraversingInOrder_ThenPrintValues() {
 
diff --git a/data-structures/src/test/java/com/baeldung/trie/TrieUnitTest.java b/data-structures/src/test/java/com/baeldung/trie/TrieUnitTest.java
@@ -5,7 +5,7 @@
 import static org.junit.Assert.assertFalse;
 import static org.junit.Assert.assertTrue;
 
-public class TrieTest {
+public class TrieUnitTest {
 
     @Test
     public void whenEmptyTrie_thenNoElements() {

Original file line number	Diff line number	Diff line change
`@@ -57,7 +57,7 @@ private boolean containsNodeRecursive(Node current, int value) {`
`57`	`57`	`}`
`58`	`58`
`59`	`59`	`public void delete(int value) {`
`60`		`- deleteRecursive(root, value);`
	`60`	`+ root = deleteRecursive(root, value);`
`61`	`61`	`}`
`62`	`62`
`63`	`63`	`private Node deleteRecursive(Node current, int value) {`