Something

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