get , min , max added.

Author: mehmetpekdemir

src/com/mehmetpekdemir/Main.java

@@ -209,14 +209,16 @@ public static void main(String[] args) {
 
 		System.out.println("\n----------Pre Order----------");
 		tree.traversePreOrder();
-		
+
 		System.out.println("\n----------In Order----------");
 		tree.traverseInOrder();
-		
+
 		System.out.println("\n----------Post Order----------");
 		tree.traversePostOrder();
-		
-		
+
+		System.out.println("\n" + tree.get(27));
+		System.out.println(tree.min());
+		System.out.println(tree.max());
 
 	}
 

src/com/mehmetpekdemir/tree/Tree.java

@@ -35,4 +35,28 @@ public void traversePostOrder() {
 		}
 	}
 
+	public TreeNode get(int value) {
+		if (root != null) {
+			return root.get(value);
+		}
+
+		return null;
+	}
+	
+	public int min() {
+		if(root == null) {
+			return Integer.MIN_VALUE;
+		} else {
+			return root.min();
+		}
+	}
+	
+	public int max() {
+		if(root == null) {
+			return Integer.MAX_VALUE;
+		} else {
+			return root.max();
+		}
+	}
+
 }

src/com/mehmetpekdemir/tree/TreeNode.java

@@ -68,6 +68,40 @@ public void traversePostOrder() {
 		System.out.print(data + " ");
 	}
 
+	public TreeNode get(int value) {
+		if (value == data) {
+			return this;
+		}
+
+		if (value < data) {
+			if (leftChild != null) {
+				return leftChild.get(value);
+			}
+		} else {
+			if (rightChild != null) {
+				return rightChild.get(value);
+			}
+		}
+
+		return null;
+	}
+
+	public int min() {
+		if (leftChild == null) {
+			return data;
+		} else {
+			return leftChild.min();
+		}
+	}
+
+	public int max() {
+		if (rightChild == null) {
+			return data;
+		} else {
+			return rightChild.max();
+		}
+	}
+
 	public int getData() {
 		return data;
 	}
@@ -92,4 +126,9 @@ public void setRightChild(TreeNode rightChild) {
 		this.rightChild = rightChild;
 	}
 
+	@Override
+	public String toString() {
+		return "[Data=" + data + "]";
+	}
+
 }