Write efficient functions (and give their Big-Oh running times)that take a pointer to a binary tree root T and compute:

a.The number of leaves of 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-Write efficient functions (and give their Big-Oh running times) that take a pointer to a binary tree root T and compute: a.The number of leaves of 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