BinaryTree

congcongcong250 · congcongcong250 · commit 6d3967a597cb · 2017-02-26T13:23:33.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
@@ -1,11 +1,23 @@
 package com.github.congcongcong250.coding2017.basic;
 
-public class BinaryTreeNode {
+public class BinaryTreeNode <Object extends Comparable<Object>>{
 	
 	private Object data;
 	private BinaryTreeNode left;
 	private BinaryTreeNode right;
 	
+	public BinaryTreeNode(){
+		data = null;
+		left = null;
+		right = null;
+	}
+	
+	public BinaryTreeNode(Object obj){
+		data = obj;
+		left = null;
+		right = null;
+	}
+	
 	public Object getData() {
 		return data;
 	}
@@ -26,7 +38,35 @@ public void setRight(BinaryTreeNode right) {
 	}
 	
 	public BinaryTreeNode insert(Object o){
-		return  null;
+		//If is empty root
+		if(data == null){
+			data = o;
+			return this;
+		}
+
+		//If it is a normal root
+		BinaryTreeNode in;
+		
+		if(o.compareTo(data) <= 0){
+			if(left == null){
+				in = new BinaryTreeNode(o);
+				left = in;
+			}else{
+				in = left.insert(o);
+			}
+		}else{
+			if(right == null){
+				in = new BinaryTreeNode(o);
+				right = in;
+			}else{
+				in = right.insert(o);
+			}
+		}
+		
+		assert (in == null):"Insert error";
+		return in;
 	}
 	
+	
+	
 }
