Free and forgetful functors add and remove structure in the most extreme way. Adding or removing some structure requires some choices but these functors depend only on the category that we are working in.
A free foo happens to be the simplest thing that satisfies all of the 'foo' laws. That is to say it satisfies exactly the laws necessary to be a foo and nothing extra.