iSharkFly-Docs
/
java-tutorials
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

tests refactoring

This commit is contained in:
Marcos 2017-12-10 19:27:45 +01:00
parent 7775a9bbe2
commit 72d162ddc9
2 changed files with 13 additions and 70 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
core-java/src/main/java/com/baeldung/tree/BinaryTree.java
View File

@ -39,7 +39,6 @@ public class BinaryTree {
parent = current;
}
}
public boolean isEmpty() {

82
core-java/src/test/java/com/baeldung/tree/BinaryTreeTest.java
View File

@ -10,15 +10,7 @@ public class BinaryTreeTest {
@Test
public void givenABinaryTree_WhenAddingElements_ThenTreeNotEmpty() {
BinaryTree bt = new BinaryTree();
bt.add(6);
bt.add(4);
bt.add(8);
bt.add(3);
bt.add(5);
bt.add(7);
bt.add(9);
BinaryTree bt = createBinaryTree();
assertTrue(!bt.isEmpty());
}
@ -26,66 +18,28 @@ public class BinaryTreeTest {
@Test
public void givenABinaryTree_WhenAddingElements_ThenTreeContainsThoseElements() {
BinaryTree bt = new BinaryTree();
bt.add(6);
bt.add(4);
bt.add(8);
bt.add(3);
bt.add(5);
bt.add(7);
bt.add(9);
BinaryTree bt = createBinaryTree();
assertTrue(bt.containsNode(6));
assertTrue(bt.containsNode(4));
assertTrue(bt.containsNode(8));
assertTrue(bt.containsNode(3));
assertTrue(bt.containsNode(5));
assertTrue(bt.containsNode(7));
assertTrue(bt.containsNode(9));
assertFalse(bt.containsNode(1));
assertFalse(bt.containsNode(10));
}
@Test
public void givenABinaryTree_WhenDeletingElements_ThenTreeDoesNotContainThoseElements() {
BinaryTree bt = new BinaryTree();
bt.add(6);
bt.add(4);
bt.add(8);
bt.add(3);
bt.add(5);
bt.add(7);
bt.add(9);
BinaryTree bt = createBinaryTree();
assertTrue(bt.containsNode(9));
bt.delete(9);
assertFalse(bt.containsNode(9));
assertTrue(bt.containsNode(6));
bt.delete(6);
assertFalse(bt.containsNode(6));
assertTrue(bt.containsNode(4));
bt.delete(4);
assertFalse(bt.containsNode(4));
}
@Test
public void givenABinaryTree_WhenTraversingInOrder_ThenPrintValues() {
BinaryTree bt = new BinaryTree();
bt.add(6);
bt.add(4);
bt.add(8);
bt.add(3);
bt.add(5);
bt.add(7);
bt.add(9);
BinaryTree bt = createBinaryTree();
bt.traverseInOrder(bt.root);
}
@ -93,15 +47,7 @@ public class BinaryTreeTest {
@Test
public void givenABinaryTree_WhenTraversingPreOrder_ThenPrintValues() {
BinaryTree bt = new BinaryTree();
bt.add(6);
bt.add(4);
bt.add(8);
bt.add(3);
bt.add(5);
bt.add(7);
bt.add(9);
BinaryTree bt = createBinaryTree();
bt.traversePreOrder(bt.root);
}
@ -109,15 +55,7 @@ public class BinaryTreeTest {
@Test
public void givenABinaryTree_WhenTraversingPostOrder_ThenPrintValues() {
BinaryTree bt = new BinaryTree();
bt.add(6);
bt.add(4);
bt.add(8);
bt.add(3);
bt.add(5);
bt.add(7);
bt.add(9);
BinaryTree bt = createBinaryTree();
bt.traversePostOrder(bt.root);
}
@ -125,6 +63,12 @@ public class BinaryTreeTest {
@Test
public void givenABinaryTree_WhenTraversingLevelOrder_ThenPrintValues() {
BinaryTree bt = createBinaryTree();
bt.traverseLevelOrder();
}
private BinaryTree createBinaryTree() {
BinaryTree bt = new BinaryTree();
bt.add(6);
@ -135,7 +79,7 @@ public class BinaryTreeTest {
bt.add(7);
bt.add(9);
bt.traverseLevelOrder();
return bt;
}
}