notes / function to insert new node in binary search tree to get tree created*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=nullelse temp /traverse the tree to get pointer to that node whose child will be the newly created node*while(temp !nulltemp temp iftemp ->data valtemp temp ->lchildelse temp temp ->rchildiftemp ->data valtemp ->lchild (struct tnode*)malloc(sizeof(struct tnode));*inserts the newly created node as left child*temp temp ->lchildif(temp =nullprintf("cannot allocate\ ") lovely professional university