notes return( )/ function to binary tree in inorder *void inorder(struct tnode *pif( !nullinorder( ->lchild)printf("% \ ", ->data)inorder( ->rchild)void main(struct tnode *root nullint ,xprintf("enter the number of nodes\ ")scanf("% ",& )whilen -- printf("enter the data value\ ")scanf("% ",& )root insert(root, )inorder(root)printf("\nthe number of nodes in tree are :% \ ",count(root))input the number of nodes the created tree should have the data values of the nodes in the tree to be created are output the number of nodes in the tree is searching for target key in binary search tree searching for the key in the given binary search treestart with the root node and compare the key with the data value of the root node if they matchreturn the root pointer if the key is less than the data value of the root noderepeat the process by using the left subtree otherwiserepeat the same process with the right subtree until either match is found or the subtree under consideration becomes an empty tree lovely professional university