What is the maximum space for Deterministic Turning Machine?

What will be the maximum space for a deterministic Turing machine if its language is decidable in f(n) steps?