From 84a4b0e2a909d430263812701b082e7c98a282c2 Mon Sep 17 00:00:00 2001
From: DonaldY <448641125@qq.com>
Date: Mon, 22 May 2017 14:51:56 +0800
Subject: [PATCH] twelfth week homework

---
 .../12-TwelfthWeek/BinarySearchTree.java      | 48 +++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 group24/Homework/12-TwelfthWeek/BinarySearchTree.java

diff --git a/group24/Homework/12-TwelfthWeek/BinarySearchTree.java b/group24/Homework/12-TwelfthWeek/BinarySearchTree.java
new file mode 100644
index 0000000000..aea8affc09
--- /dev/null
+++ b/group24/Homework/12-TwelfthWeek/BinarySearchTree.java
@@ -0,0 +1,48 @@
+package com.coding.basic.tree;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import com.coding.basic.queue.Queue;
+
+public class BinarySearchTree<T extends Comparable> {
+	
+	BinaryTreeNode<T> root;
+	public BinarySearchTree(BinaryTreeNode<T> root){
+		this.root = root;
+	}
+	public BinaryTreeNode<T> getRoot(){
+		return root;
+	}
+	public T findMin(){
+		return null;
+	}
+	public T findMax(){
+		return null;
+	}
+	public int height() {
+	    return -1;
+	}
+	public int size() {
+		return -1;
+	}
+	public void remove(T e){
+		
+	}
+	public List<T> levelVisit(){
+		
+		return null;
+	}
+	public boolean isValid(){
+		return false;
+	}
+	public T getLowestCommonAncestor(T n1, T n2){
+		return null;
+        
+	}
+	public List<T> getNodesBetween(T n1, T n2){
+		return null;
+	}
+	
+}
+