->exp= ->expz ->coef= ->coefnotes = -linkif ( ->expexpz->exp= ->expz ->coef= ->coefq= ->linkif( -exp= ->exp)!= ->exp= ->expz->coef= ->expp= ->linkq= ->linkz->link malloc(sizeof(struct poly)) = -linkwhile ( !=nullz->exp= ->expz->coef= ->coefz->linkmalloc(sizeof(struct poly)) = ->linkp= ->linkwhile ( !=nullz->exp= ->expz->coef= ->coefz->link=malloe(sizeof(struct poly)) = ->linkq= ->linkcursor implementation of linked lists consider case where we have two linked lists pointed to by two different pointerssay and respectivelyand we want to concatenate nd list at the end of the first list we can do it by traversing first list till the end and then store the address of first node in the second listin the link field of last node of first list suppose we are traversing first list by pointer tempthen we can concatenate the list by the statement (figure temp -link qlovely professional university