Define the Fibonacci binary tree of order n as follows: If n=0 or n=1, the tree consists of a single node. If n>1, the tree consists of a root, with the Fibonacci tree of order n-1 as the left subtree and the Fibonacci tree of order n-2 as the right subtree.
A) Write a function that returns a pointer to the Fibonacci binary tree of order n.
B) Is such a tree strictly binary?
C) What is the number of leaves in the Fibonacci tree of order n?
D) What is the depth of the Fibonacci tree of order n?