This will print Binary equivalent of number n. It will keep dividing by two, the number until it will reach to 1 or 0. Then it start printing in reverse.
The reverse order comes from the fact that its a head Recursion (A recursion is called head recursion when function get called before print statement).
For example if we call this f(10) then it will print 1010.