public Node<T> search(T target) {
			return search(target, root);
		}

		private Node<T> search(T target, Node<T> p) {
			if(p == null)
				return null;
			int comp = target.compareTo(p.data);
			if(comp == 0)
				return p;
			if(comp < 0)
				return search(target, p.left);
			if(comp > 0)
				return search(target, p.right);
			return null;
		}