数据结构各章的全国各大院校的考研习题 对广大考研学生来说非常有用...

一个算法问题包括，一些数据结构的算法，全部是已经编译通过的源码，且是我自己写的！- An algorithm question includes, some constructions of data algorithms, completely were already translated through the source codes, was precisely I writes!

算符有限分析法 //程序功能： //根据算符优先分析法，将表达式进行语法分析，判断一个表达式是否正确。 //文法：E→E+E E-E E*E E/E (E) i // 其中i为无符号整数-operator limited analysis// procedural functions :// operator under priority analysis, to conduct regular expression syntax analysis, judgment, an expression is correct.// Grammar : E E E E-E E E* E/E (E) i// for which i unsigned integers

我自己写的数值分析课程设计的源代码，这里是数值插值算法的内容。-I wrote it myself numerical analysis courses designed source code, here is the interpolation algorithm for the numerical content.

本光盘是《数据结构(C语言版)》一书的配书光盘，作为数据结构课程的 辅助学习工具。-the CD is "data structure (C-language version)," a book on CD-ROM distribution, as a data structure courses assisted learning tools.

操作系统实验第一个-an OS experiment

北航《数据结构》PPT,内容详细，逻辑感强，适合自学-Beijing Institute of Aeronautics " data structure" PPT, and detailed, logical sense, good for self-study

【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash【10】玉兔_spi_dataflash

回文数的判断，用栈和队列做的！希望大家可以互相交流一下-Palindrome number of judgments, with stacks and queues to do! Hope that we can exchange what

C、C++语言实现的数据结构重要算法和程序 比较全。-C, C language data structures and algorithms important procedure is all.

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo