资源列表
pinghengerchashu
- 本文详细解说了平衡二叉树算法，很好的原创学习材料-This detailed explanation of the balanced binary tree algorithm, very good original learning materials
thread
- 线索树-中序线索树的前序、中序、后序遍历。后序遍历有详细注释。-Trail tree- the tree inorder clues before preorder, inorder, postorder traversal. After preorder detailed notes.
avl
- AVL树（平衡树），根据程序运行时的提示，动态输入字符作为结点，在调整平衡时会有提示。-AVL tree (balanced tree), according to the program runtime prompts, dynamic input characters as a junction point, there will be prompted to adjust the balance.
trie
- 简单实现trie树，这里的删除没有用到其它的数据结构诸如堆栈，而是利用另外的指针存储路径来删除，详见代码和注释。-Simple implementation of trie tree, where the deletion is not used other data structures such as stacks, but to use a pointer to another storage path to delete, see the code and comments.
bplus_tree
- C语言描述 B+树。全英文注释，非常详细。在GPLv3协议下发布。实现了增加、删除结点等常用功能。-C language descr iption B+ trees. Comments in English and very detailed. Released under the GPLv3. Achieve add, delete nodes and other common functions.
Face_detect
- 基于haar特征和adaboost算法的人脸识别程序.-Haar features and adaboost algorithm based face recognition process.
xsjzh
- 数据结构稀疏矩阵实现及应用(在三元组和十字链表下)-Sparse matrix data structure implementation and application (cross-list in triples and under)
graph
- 1. 分别以邻接矩阵和邻接表的存储结构建立图。 2. 分别对图进行深度优先遍历和广度优先遍历。 3. 求图中边的数目。 4. 求顶点0到图中其余每个顶点的最短路径。 -1, respectively, the adjacency matrix and adjacency list storage structure created map. 2, respectively, the graph depth-first traversal and breadth-fir
fight-system
- 航空订票系统，可实现机票的查询，订购功能。-it will be very good to use。
datastruct
- 对于数据结构的相关练习，操作，有意义提高编程思想-For data structures related exercises, operations, improve programming ideas meaningful
hanoi
- 提高递归的编程思想，此函数是对汉诺塔的操作-Improve recursive programming ideas, this function is the operation of the Tower of Hanoi
List
- 单链表定义、操作，实现增、删、改、查等功能，传递的参数用引用-Single list definitions, operation, to achieve add, delete, change, search and other functions, the parameters passed by reference