Question: Write efficient methods (and give their Big-Oh running times) that take a reference to a binary tree root T and compute
a. The number of leaves in T
b. The number of nodes in T that contain one non-null child
c. The number of nodes in T that contain two non-null children