Factorial, power, reversing a string and summing digits are small problems that train you to trust the smaller call. Each one shows how to build the answer for n from the answer for a smaller input. Practise these until writing the recursive case feels routine, because trees and backtracking depend on it. For simple linear problems in real code a loop is often clearer and avoids deep call stacks.