notes exit( )temp ->data valtemp ->lchild=temp ->rchild nullelse temp ->rchild (struct tnode*)malloc(sizeof(struct tnode));*inserts the newly created node as left child*temp temp ->rchildif(temp =nullprintf("cannot allocate\ ")exit( )temp ->data valtemp ->lchild=temp ->rchild nullreturn( )void main(struct tnode *root nullint ,xprintf("enter the number of nodes in the tree\ ")scanf("% ",& )whilen printf("enter the data value\ ")scanf("% ",& )root insert(root, )printf("the created tree is :\ ")inorder (root)printf("\ enter the value of the node to be deleted\ ")scanf("% ",& )root=delete(root, )printf("the tree after deletion is \ ")inorder (root)lovely professional university