notes int datastruct node *left*right}struct dnode *insert(struct dnode *pstruct dnode **qint nstruct dnode *temp/if the existing list is empty then insert new node as the starting node *if( ==nullp=(struct dnode *)malloc(sizeof(struct dnode))/creates new node data value passed as parameter *if( ==nullprintf("error\ ")exit( ) -data np-left ->right =null* = else temp (struct dnode *)malloc(sizeof(struct dnode))/creates new node using data value passed as parameter and puts its address in the temp *if(temp =nullprintf("error\ ")exit( )temp-data ntemp->left (* )temp->right null(*qtemplovely professional university