Data structure topics. Let l be a single linked list with leading nodes, and the element value is shaping. Write a function, delete
Nodes *p, * q；; inti = 0； P = head; And (me! =(pos- 1)){ if(p-& gt； Au Suivant! = null){ p = p-& gt； Next; i++； }}q=(node*)malloc (node); q->； Data = value; p->； next = q； q->； next = p-& gt； Next;