摘要： //C++ 对列的基本预算#include <iostream>using namespace std;typedef struct node{ int data; struct node *next;}node;typedef struct quene{ node *head; node *end;}quene;/*创建一个空链式队列*/int Create(struct quene *s){ s->head = (node*)malloc(sizeof(node));//申请头节点 if (s->head == NULL) { cout<<"I 阅读全文

摘要： http://blacksnow.blog.51cto.com/265898/162216/http://www.cnblogs.com/Clingingboy/archive/2011/03/20/1989752.htmlhttp://blog.csdn.net/wanhui520/article/details/7021180 阅读全文