Insertion and deletion of doubly linked list

• Insert

s->next=p->next;s->prior=p;p->next=s;s->next->prior=s;

• Delete

p->next=q;p->next=q->next;q->next->prior=p;free(q);

---

️Video tutorial