child in a binary tree: nt() function shown below that returns the number of nodes with a single class Node public: Node(int n)( this->n = n; left right nullptr; int n; Node left; Node right; int sCCount(Node *p) if (p return O; else if (( !: NULL && NULL) I 1 == NULL && != NULL)) return 1+sCCount+sCCount else return sCCount+sCCount