1) A "full node" in a binary tree has either no children or exactly 2 children. Given a binary tree, write a function that returns true if all nodes are full nodes. Otherwise return false. Notes: The function should have just one argument, a pointer to the root. No global variables may be used. No additional functions may be defined