Optimal Binary Recursion

#1

In the above code in the base case why we returning 1 instead of 0? Because 0 length binary string count is 0.

#2

for n =0 we have only one choice that is not putting either 0 or 1, an empty string.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.