Simple BinaryTreeNode test pass

congcongcong250 · congcongcong250 · commit b9b061cb2a52 · 2017-02-27T02:38:24.000+11:00
diff --git a/group02/609990377/DataStructure/src/com/github/congcongcong250/coding2017/basic/BinaryTreeNode.java b/group02/609990377/DataStructure/src/com/github/congcongcong250/coding2017/basic/BinaryTreeNode.java
@@ -37,6 +37,12 @@ public void setRight(BinaryTreeNode right) {
 		this.right = right;
 	}
 	
+	public void destroy(){
+		this.data = null;
+		this.left = null;
+		this.right = null;
+	}
+	
 	public BinaryTreeNode insert(Object o){
 		//If is empty root
 		if(data == null){
diff --git a/group02/609990377/DataStructure/src/com/github/congcongcong250/coding2017/basicTest/BinaryTreeNodeTest.java b/group02/609990377/DataStructure/src/com/github/congcongcong250/coding2017/basicTest/BinaryTreeNodeTest.java
@@ -0,0 +1,69 @@
+package com.github.congcongcong250.coding2017.basicTest;
+
+import static org.junit.Assert.*;
+
+import java.util.NoSuchElementException;
+
+import org.junit.After;
+import org.junit.Before;
+import org.junit.Test;
+
+import com.github.congcongcong250.coding2017.basic.BinaryTreeNode;
+
+public class BinaryTreeNodeTest implements testCase {
+
+	BinaryTreeNode node = new BinaryTreeNode();
+	
+	@Override
+	@Before
+	public void setUp() {
+		node.insert(10);
+
+	}
+
+	@Override
+	@After
+	public void tearDown() {
+		node.destroy();
+	}
+
+	@Override
+	@Test
+	public void testAdd() {
+		assertEquals(10,node.getData());
+		node.insert(5);
+		assertEquals(5,node.getLeft().getData());
+		node.insert(1);
+		node.insert(2);
+		node.insert(6);
+		node.insert(19);
+		node.insert(18);
+		/*
+		 *                  10
+		 *          5                19
+		 *    1          6      18  
+		 *        2
+		 * 
+		 * */
+		assertEquals(1,node.getLeft().getLeft().getData());
+		assertEquals(2,node.getLeft().getLeft().getRight().getData());
+		assertEquals(6,node.getLeft().getRight().getData());
+		assertEquals(19,node.getRight().getData());
+		assertEquals(18,node.getRight().getLeft().getData());
+	}
+
+	@Override
+	@Test
+	public void testRemove() {
+		// TODO Auto-generated method stub
+
+	}
+
+	@Override
+	@Test
+	public void testFunctional() {
+		// TODO Auto-generated method stub
+
+	}
+
+}
diff --git a/group02/609990377/DataStructure/src/com/github/congcongcong250/coding2017/basicTest/TestRunner.java b/group02/609990377/DataStructure/src/com/github/congcongcong250/coding2017/basicTest/TestRunner.java
@@ -14,6 +14,14 @@ public static void main(String[] args){
 		LinkedListTest LLT = new LinkedListTest();
 		test(LLT);
 		
+		StackTest STT = new StackTest();
+		test(STT);
+		
+		QueueTest QT = new QueueTest();
+		test(QT);
+		
+		BinaryTreeNodeTest BTNT = new BinaryTreeNodeTest();
+		test(BTNT);
 	    
 	}
 	
@@ -23,7 +31,7 @@ private static Result test(testCase tc){
 	    for (Failure failure : result.getFailures()) {
 	    	System.out.println(failure.toString());
 	    }
-	    System.out.println(result.wasSuccessful());
+	    System.out.println(tc.getClass().toString()+ "\n>>> Test status: "+result.wasSuccessful());
 	    
 	    return result;
 	}

Original file line number	Diff line number	Diff line change
`@@ -14,6 +14,14 @@ public static void main(String[] args){`
`14`	`14`	`LinkedListTest LLT = new LinkedListTest();`
`15`	`15`	`test(LLT);`
`16`	`16`
	`17`	`+ StackTest STT = new StackTest();`
	`18`	`+ test(STT);`
	`19`	`+`
	`20`	`+ QueueTest QT = new QueueTest();`
	`21`	`+ test(QT);`
	`22`	`+`
	`23`	`+ BinaryTreeNodeTest BTNT = new BinaryTreeNodeTest();`
	`24`	`+ test(BTNT);`
`17`	`25`
`18`	`26`	`}`
`19`	`27`
`@@ -23,7 +31,7 @@ private static Result test(testCase tc){`
`23`	`31`	`for (Failure failure : result.getFailures()) {`
`24`	`32`	`System.out.println(failure.toString());`
`25`	`33`	`}`
`26`		`- System.out.println(result.wasSuccessful());`
	`34`	`+ System.out.println(tc.getClass().toString()+ "\n>>> Test status: "+result.wasSuccessful());`
`27`	`35`
`28`	`36`	`return result;`
`29`	`37`	`}`