Binary recursion is a specific form of exponential recursion, where one function calls the recursive function more than once (in case of binary two).
Recursive functions calls exponentially in this type of recursion.