Python Recursion with Data

def fib(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fib(n-1) + fib (n-2)

#test
print("Test fib(5)=5", fib(5) == 5)
print("Test fib(7)=13", fib(7) ==13)

class Tree:
    def __init__ (self, entry, left = None, right = None):
        self.entry = entry
        self.left = left
        self.right = right


def fibtree(n):
    if n==0: return Tree(0)
    if n==1: return Tree(1)
    left = fibtree(n-2)
    right = fibtree(n-1)
    return Tree(left.entry + right.entry, left, right)

print(fibtree(5))
print("Test fibtree(5)", fibtree(5).entry == 5)
print("Test fibtree(5).left", fibtree(5).left.entry == 2)
print("Test fibtree(5).right", fibtree(5).right.entry== 3)