尼古拉斯豆

摘要： #include <stdio.h>struct node{ char ch; struct node *next;};/* 1.初始化单链表*/void init(struct Node **h){ *h = (struct node *)mallov(sizeof(struct node)); if(*h == NULL) { printf("空间申请失败...\n"); system("pause"); } (*h)->next = NULL: return; }/* 2.将x节点插入到链表后*/... 阅读全文

摘要： 队列一般叫优先级队列.这是跟它的相关应用有关的.#include <stdio.h>#include <stdlib.h> typedef int elemType;struct sNode{ /*队列节点*/ elemType data; struct sNode *next;};struct queueLK{ struct sNode *front; /*队列头指针*/ struct sNode *rear; /*队列尾指针*/};/* 1.初始化链队*/void initQueue(struct queueLK *hq)... 阅读全文