public boolean ifind(int key) {
		BSTNode auxRoot = root;
		while (auxRoot != null) {
			if (auxRoot.data == key)
				return true;
			if (key < auxRoot.data)
				auxRoot = auxRoot.left;
			else auxRoot = auxRoot.right;
		}
		return false;
	}