二叉树实现MyBinaryTree

zoakerc · zoakerc · commit c53e09daf1f8 · 2017-02-26T02:00:44.000+08:00
diff --git a/group07/562247675/homework/homework-0226/src/main/java/com/coding2017/group7/homework/c0226/MyBinaryTreeNode.java b/group07/562247675/homework/homework-0226/src/main/java/com/coding2017/group7/homework/c0226/MyBinaryTreeNode.java
@@ -2,15 +2,15 @@
 
 public class MyBinaryTreeNode {
 
-    private Object data;
+    private Comparable data;
     private MyBinaryTreeNode left;
     private MyBinaryTreeNode right;
 
-    public Object getData() {
+    public Comparable getData() {
         return data;
     }
 
-    public void setData(Object data) {
+    public void setData(Comparable data) {
         this.data = data;
     }
 
@@ -30,8 +30,23 @@ public void setRight(MyBinaryTreeNode right) {
         this.right = right;
     }
 
-    public MyBinaryTreeNode insert(Object o) {
-        return null;
+    public MyBinaryTreeNode insert(Comparable o) {
+        if (data == null) {
+            data = o;
+        }
+        int compare = o.compareTo(data);
+        if (compare < 0) {
+            if (left == null) {
+                left = new MyBinaryTreeNode();
+            }
+            left.insert(o);
+        } else if (compare > 0) {
+            if (right == null) {
+                right = new MyBinaryTreeNode();
+            }
+            right.insert(o);
+        }
+        return this;
     }
 
 }
diff --git a/group07/562247675/homework/homework-0226/src/test/java/com/coding2017/group7/homework/c0226/MyBinaryTreeNodeTest.java b/group07/562247675/homework/homework-0226/src/test/java/com/coding2017/group7/homework/c0226/MyBinaryTreeNodeTest.java
@@ -0,0 +1,34 @@
+package com.coding2017.group7.homework.c0226;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+public class MyBinaryTreeNodeTest {
+
+
+    @Test
+    public void insert() throws Exception {
+        MyBinaryTreeNode node = new MyBinaryTreeNode();
+        node.insert(5)
+                .insert(2)
+                .insert(7)
+                .insert(1)
+                .insert(6)
+                .insert(4)
+                .insert(8)
+                .insert(3);
+        Comparable data1 = node.getLeft().getLeft().getData();
+        Comparable data4 = node.getLeft().getRight().getData();
+        Comparable data6 = node.getRight().getLeft().getData();
+        Comparable data8 = node.getRight().getRight().getData();
+        Comparable data3 = node.getLeft().getRight().getLeft().getData();
+        Assert.assertEquals(1, data1);
+        Assert.assertEquals(4, data4);
+        Assert.assertEquals(6, data6);
+        Assert.assertEquals(8, data8);
+        Assert.assertEquals(3, data3);
+
+    }
+
+
+}
