Add appropriate lines of code to the
following function skeleton so that the function will
recursively count the number of nodes in the binary tree
pointed at by "root".
If the root is null, then return 0.
Otherwise, return 1 plus the count for the left and right children.