MY NODE

  //BFS #include <stdio.h> #include <stdlib.h> #include<string.h> int main() {     int t, n, m, start, i;     int a[110][110], book[110], q[110];     scanf("%d", &t);     while...

#include <stdio.h> #include <stdlib.h> #include<string.h> struct node { int data; struct node *next; }; struct node *head[101], *p, *q; int book[101], n, m, start; void sort...