Q3. Write ecient functions that take only a pointer to the root of a binary search tree, T, and compute (a) the number of nodes in T (call this function numNodes)

(b) the number of leaves in T (call this function numLeaves)

You can use the Chapter 4 BinarySearchTree code as your starting point. Add two new functions to it and make sure your code compiles. Also, modify bstEx to test your two new functions. Submit C++ les that do the aforementioned.