图的遍历:
无论是广度优先,还是深度优先都是以箭头方向右边的优先遍历;
广度优先遍历(无向图):
深度优先(无向图):
单向链表 :头插法
head = NULL;
new_node = malloc(sizeof(struct node));
new_node ->date = 5;
new_node -> next = head;
无论是广度优先,还是深度优先都是以箭头方向右边的优先遍历;
head = NULL;
new_node = malloc(sizeof(struct node));
new_node ->date = 5;
new_node -> next = head;