public class BinaryTree {
	Node root;
	
	public class Node implements java.lang.Comparable {
		Node right;
		Node left;
		int value;
		
		public Node(int val) {
			right = null;
			left = null;
			value = val;
		}
		
		public int compareTo(Node o) {
			return 0;
		}
	}
	
	public BinaryTree() {
	}
	
	public boolean search(int val, Node currentNode) {
		if(val == currentNode.value) {
			return true;
		} else if(val < currentNode.value) {
			return search(val, currentNode.left);
		} else  if(val > currentNode.value) {
			return search(val, currentNode.right);
		}
		return false;
	}
	
	public void insert(int val) {
		
	}
	
	public int getElementCount() {
		return 0;
	}
	
	public int getTreeHeight() {
		return 0;
	}
	
	public int getLeafCount() {
		return 0;
	}
	
}