Given that:
How do i write a function:Code:typedef struct node { char *title; char *ISBN[10]; struct book *next; } insert_queue;
void title_insert (insert_queue **front, insert_queue **rear, char *name, char *ISBN[]) such that *front point to the 1st node, *rear point to the last node. It will insert a new node with title and ISBN at the end of queue and update front and rear.
Thanks all.