  In this first paper, we look at the following question: are the properties of
the Fibonacci tree still true if we consider a finitely generated tree by the
same rules but rooted at a black node? The direct answer is no, but new
properties arise, a bit more complex than in the case of a tree rooted at a
white node, but still of interest.
