class FibTree(object):

    def __init__(self, n):
        self.n = n
if n < 2:
    self.value = n
else:
    self.left = FibTree(n - 1)
self.right = FibTree(n - 2)
How can I recursively insert the Fibonacci sequence into a binary tree