counting the number of nodes in binary search tree notes counting the number of nodes in given binary treethe tree is required to be traversed recursively until leaf node is encountered when leaf node is encountereda count of is returned to its previous activation (which is an activation for its parent)which takes the count returned from both the children' activationadds to itand returns this value to the activation of its parent this waywhen the activation for the root of the tree returnsit returns the count of the total number of the nodes in the tree lab exercise programa complete program to count the number of nodes is as follows#include #include struct tnode int datastruct tnode *lchild*rchild}int count(struct tnode *pifp =nullreturn( )else ifp->lchild =null & ->rchild =nullreturn( )else return( (count( ->lchildcount( ->rchild)))struct tnode *insert(struct tnode * ,int valstruct tnode *temp ,*temp if( =nullp (struct tnode *malloc(sizeof(struct tnode))/insert the new node as root node*if( =nullprintf("cannot allocate\ ")exit( ) ->data valp->lchild= ->rchild=nulllovely professional university