Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Create DepthFirstSearchTest.java

Browse Source 
this test is created for the DepthFirstSearch.java file- that I added- containing the DepthFirstSearch algorithm
This commit is contained in:
Abir Bhushan 2019-04-15 11:38:59 +01:00 committed by GitHub
parent 6938c409f9
commit 4d9965cb94
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 36 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
src/test/java/com/search/DepthFirstSearchTest.java Normal file
View File

@ -0,0 +1,36 @@
package src.test.java.com.search;
import org.junit.Assert;
import org.junit.Test;
import src.main.java.com.search.DepthFirstSearch;
import src.main.java.com.search.BinaryTree;
public class DepthFirstSearchTest {
@Test
public void testDepthFirstSearch() {
BinaryTree<Integer> tree1 = new BinaryTree<Integer>();
tree1.add(1,1);
tree1.add(2,2);
tree1.add(3,3);
tree1.add(4,4);
Assert.assertEquals("Incorrect index", 3, DepthFirstSearch.find(3, tree1));
Assert.assertEquals("Incorrect index", 1, DepthFirstSearch.find(1, tree1));
Assert.assertEquals("Incorrect index", null, DepthFirstSearch.find(0, tree1));
Assert.assertEquals("Incorrect index", null, DepthFirstSearch.find(8, tree1));
Assert.assertEquals("Incorrect index", null, DepthFirstSearch.find(-2, tree1));
BinaryTree<String> tree2 = new BinaryTree<String>();
tree2.add("1","A");
tree2.add("2","B");
tree2.add("3","C");
tree2.add("4","D");
Assert.assertEquals("Incorrect index", "C", LinearSearch.findIndex(tree2,"3"));
Assert.assertEquals("Incorrect index", "B", LinearSearch.findIndex(tree2,"2"));
Assert.assertEquals("Incorrect index", null, LinearSearch.findIndex(tree2,"F"));
BinaryTree<String> tree3 = new BinaryTree<String>();
Assert.assertEquals("Incorrect index", null, LinearSearch.findIndex(tree3, ""));
}
}