Add my first code v1.1

harryhook · harryhook · commit e6ef9f1b191e · 2017-02-26T09:40:52.000+08:00
diff --git a/group02/727171008/src/com/github/HarryHook/coding2017/basic/BinaryTreeNode.java b/group02/727171008/src/com/github/HarryHook/coding2017/basic/BinaryTreeNode.java
@@ -25,7 +25,7 @@ public void inOrder(BinaryTreeNode node)
 	//获取给节点的值
 	public Integer getData() 
 	{
-		return this.data;
+		return data;
 	}
 	//给一个节点赋值
 	public void setData(Integer data)
@@ -64,7 +64,7 @@ public BinaryTreeNode insert(Integer obj)
         // 上个节点
         BinaryTreeNode parent  = null;
         // 如果根节点为空
-        if  (this.data == null) 
+        if  (current.data == null) 
         {	
         	newNode.setData(obj);
         	newNode.setLeft(null);
diff --git a/group02/727171008/src/com/github/HarryHook/coding2017/basic/BinaryTreeNodeTest.java b/group02/727171008/src/com/github/HarryHook/coding2017/basic/BinaryTreeNodeTest.java
@@ -10,29 +10,29 @@
 public class BinaryTreeNodeTest 
 {
 
-	BinaryTreeNode binaryTreeNode = new BinaryTreeNode();
+	BinaryTreeNode binaryTreeNode;
 
 	@Before
 	public void setUpBinaryTreeNode() 
 	{
-		//binaryTreeNode = new BinaryTreeNode();
+		binaryTreeNode = new BinaryTreeNode();
 	}
 
 	@Test
 	public void testBinaryTreeNodeFunctional() 
 	{
-		binaryTreeNode.insert(4);
+		binaryTreeNode = binaryTreeNode.insert(4);
 		binaryTreeNode.insert(1);
 		binaryTreeNode.insert(3);
 		binaryTreeNode.insert(5);
 		binaryTreeNode.insert(2);
-
+		
 		assertEquals(true, 4 == binaryTreeNode.getData());
 		assertEquals(true, 1 == binaryTreeNode.getLeft().getData());
 		assertEquals(true, 5 == binaryTreeNode.getRight().getData());
 		assertEquals(true, 3 == binaryTreeNode.getLeft().getRight().getData());
 		assertEquals(true, 2 == binaryTreeNode.getLeft().getRight().getLeft().getData());
-		
+
 		//节点为空  说明值没有插进去
 		binaryTreeNode.inOrder(binaryTreeNode);
 	}

Original file line number	Diff line number	Diff line change
`@@ -25,7 +25,7 @@ public void inOrder(BinaryTreeNode node)`
`25`	`25`	`//获取给节点的值`
`26`	`26`	`public Integer getData()`
`27`	`27`	`{`
`28`		`- return this.data;`
	`28`	`+ return data;`
`29`	`29`	`}`
`30`	`30`	`//给一个节点赋值`
`31`	`31`	`public void setData(Integer data)`
`@@ -64,7 +64,7 @@ public BinaryTreeNode insert(Integer obj)`
`64`	`64`	`// 上个节点`
`65`	`65`	`BinaryTreeNode parent = null;`
`66`	`66`	`// 如果根节点为空`
`67`		`- if (this.data == null)`
	`67`	`+ if (current.data == null)`
`68`	`68`	`{`
`69`	`69`	`newNode.setData(obj);`
`70`	`70`	`newNode.setLeft(null);`