private T inOrderSearch(Node<T> node, T o) {
		if(node == null) {
			System.out.println("Not Found");
			return null;
		}
		
		if(o.compareTo(node.getData()) < 0) {
			return inOrderSearch(node.getLeft(), o);
		}  else if(o.compareTo(node.getData()) > 0) {
			return inOrderSearch(node.getRight(), o);
		} else {
			System.out.println("Found");
			return node.getData();
		}
	}