Define the Fibonacci binary tree of order n as follows: If n=0 or n=1, the tree consists of a single node.

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.  Add a method that builds a Fibonacci binary tree of order n and returns a pointer to it