Finished binary tree

longcloud · longcloud · commit 5918d3296204 · 2017-02-25T22:17:02.000+08:00
diff --git a/group03/619224754/src/com/coding/basic/BinaryTreeNode.java b/group03/619224754/src/com/coding/basic/BinaryTreeNode.java
@@ -1,5 +1,7 @@
 package com.coding.basic;
 
+import java.util.Comparator;
+
 public class BinaryTreeNode {
 	
 	private Object data;
@@ -9,24 +11,70 @@ public class BinaryTreeNode {
 	public Object getData() {
 		return data;
 	}
+	
 	public void setData(Object data) {
 		this.data = data;
 	}
+	
 	public BinaryTreeNode getLeft() {
 		return left;
 	}
+	
 	public void setLeft(BinaryTreeNode left) {
 		this.left = left;
 	}
+	
 	public BinaryTreeNode getRight() {
 		return right;
 	}
+	
 	public void setRight(BinaryTreeNode right) {
 		this.right = right;
 	}
 	
 	public BinaryTreeNode insert(Object o){
-		return  null;
+		BinaryTreeNode treeNode = new BinaryTreeNode();
+		treeNode.data = o;
+		int intO = Integer.parseInt(o.toString());
+		int intData = Integer.parseInt(this.data.toString());
+		if(intO > intData){
+			if(this.right == null){
+				this.right = treeNode;
+			}
+			else {
+				this.right.insert(o);
+			}
+		}
+		else {
+			if(this.left == null) {
+				this.left = treeNode;
+			}
+			else {
+				this.left.insert(o);
+			}
+		}
+		return treeNode;
+	}
+	
+	private class MyComparator implements Comparator<BinaryTreeNode> {
+
+		@Override
+		public int compare(BinaryTreeNode arg0, BinaryTreeNode arg1) {
+			// TODO Auto-generated method stub
+			int int0 = Integer.parseInt(arg0.data.toString());
+			int int1 = Integer.parseInt(arg1.data.toString());
+			if(int0 > int1) {
+				return 1;
+			}
+			else if(int0 < int1){
+				return -1;
+			}
+		
+			return 0;
+			
+		}
+		
+		
 	}
 	
 }
