A Fibonacci tree is a recursively defined binary tree whose two subtrees have consecutive smaller orders. One convention sets and to a single vertex and defines for by attaching and to a new root. Then its vertex count satisfies , so for Fibonacci numbers . The counts begin . Initial trees vary across applications, so the convention must be stated; the common feature is the consecutive-order recursive branching.
New to topics? Read the docs here!