'update'

240094626 · 240094626 · commit 2cb6d5c17be0 · 2017-02-25T22:24:25.000+08:00
diff --git a/group17/240094626/warm-up/src/com/coding/basic/impl/ArrayList.java b/group17/240094626/warm-up/src/com/coding/basic/impl/ArrayList.java
@@ -155,7 +155,7 @@ public boolean hasNext() {
 
 		@Override
 		public Object next() {
-			Object o = data[index++];
+			Object o = get(index++);
 			return o;
 		}
 		
diff --git a/group17/240094626/warm-up/src/com/coding/basic/impl/BinaryTree.java b/group17/240094626/warm-up/src/com/coding/basic/impl/BinaryTree.java
@@ -0,0 +1,82 @@
+package com.coding.basic.impl;
+
+
+/**
+ * 二叉树简单实现(key为int类型)
+ * @author 240094626
+ *
+ */
+public class BinaryTree {
+	private Node rootNode = null;
+	
+	public Node insert(int key){
+		return insert(key,null);
+	}
+	
+	public Node insert(int key ,Object o){
+		Node newNode = new Node(key, o);
+		if(rootNode == null){
+			rootNode = newNode;
+			return rootNode;
+		}
+		Node fatherNode = rootNode;
+		Node currentNode = rootNode;
+		while(currentNode != null){
+			fatherNode = currentNode;
+			if(key < currentNode.key){
+				currentNode = currentNode.left;
+			}else{
+				currentNode = currentNode.right;
+			}
+		}
+		if(key < fatherNode.key){
+			fatherNode.left = newNode;
+		}else{
+			fatherNode.right = newNode;
+		}
+		return newNode;
+	}
+	
+	public Node getNode(int key){
+		return get(rootNode, key);
+	}
+	
+	private Node get(Node n,int key){
+		if(n == null){
+			return null;
+		}
+		if(key < n.key){
+			return get(n.left, key);
+		}else if(key > n.key){
+			return get(n.left, key);
+		}
+		return null;
+	}
+	
+	
+	
+
+	private static class Node{
+		
+		int key;
+		Object data;
+		Node left;
+		Node right;
+		
+		public Node(int key, Object data) {
+			this.key = key;
+			this.data = data;
+			this.left = null;
+			this.right = null;
+		}
+
+		@Override
+		public String toString() {
+			return "Node [key=" + key + ", data=" + data + "]";
+		}
+		
+		
+	}
+
+	
+}

Original file line number	Diff line number	Diff line change
`@@ -155,7 +155,7 @@ public boolean hasNext() {`
`155`	`155`
`156`	`156`	`@Override`
`157`	`157`	`public Object next() {`
`158`		`- Object o = data[index++];`
	`158`	`+ Object o = get(index++);`
`159`	`159`	`return o;`
`160`	`160`	`}`
`161`	`161`