Binary Recursion

This, as implied by the name is when each function calls itself twice in each run, then has a calculation that relies on those two values, the easiest example of which is Fibonacci’s Sequence: Recursion

def Fib(n):
	if(n <= 1):
		return n
	else
		return Fib(n-1) + Fib(n-2)