$3)(5$ pts $)$ Write an efficient function that take a pointer to the root of a binary tree, $\backslash ($ T $\backslash ),$ and compute the number of half nodes. Note that a half node is an internal tree node with exactly one child. Implement your function and show how it works using an example.