Chapter 1.2.2: leaves in Fib(n) tree is Fib(n+1)

[strint]

In fact, it is not hard to show that the number of times the procedure will compute (fib 1) or (fib 0) (the number of leaves in the above tree, in general) is precisely Fib(n + 1).