Reference no: EM132198132
Write efficient functions that take only a pointer to the root of a binary search tree, T, and compute:
a. The number of nodes in T.
b. The number of leaves in T.
c. The number of full nodes (a full node is a node with two children) in T.
Your main program reads a set of values from DataIn file into the tree, then call the above functions to compute.
The main program should print out the answer of each function (a#, b#, c#)
My code for this is not working, can someone please write a full functioning code for this question in c language (that works on Visual Studio 2015).
Its very urgent, as the submission date is close. Please can someone help.