资源列表
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.
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.
thread
- 线索树-中序线索树的前序、中序、后序遍历。后序遍历有详细注释。-Trail tree- the tree inorder clues before preorder, inorder, postorder traversal. After preorder detailed notes.
pinghengerchashu
- 本文详细解说了平衡二叉树算法，很好的原创学习材料-This detailed explanation of the balanced binary tree algorithm, very good original learning materials
erchapaixushu
- 本文详细解说了二叉排序树的算法，很好的原创学习材料-This detailed explanation of binary sort tree algorithm, very good original learning materials
guanjianlujing
- 本文详细解说了关键路径的算法，很好的原创学习材料-This detailed explanation of the critical path algorithm, very good original learning materials
zuiyoubianma
- 本文介绍了二叉树的几种遍历，是很好的原创学习材料-This article describes several binary tree traversal is a very good learning materials originality
rice-ball
- 2006 年百度之星程序设计大赛初赛题目，饭团的烦恼-Baidu in 2006 star program design contest preliminaries topic, rice ball
Antenna_arrays_in_3D
- 3D uniform rectangular array antenna beam
Survey
- survey paper for computer archi.
EK
- 图论---数据结构---算法，网络流中求最大流的经典算法，EK算法。-Graph Theory--- Data Structures--- algorithms, network flow for maximum flow of the classical algorithm, EK algorithms.
lvyoubeibao
- 旅游背包问题，采用近似算法BF、CF算法。题目：第i个物体大小为 Si, 箱子尺寸为c（maxSi<c). 现在有n个物体和m个箱子。请问，我们最少需要多少个箱子来储存这些物体？ 要求： 输入 文件名 输出：最少箱子数量 文件名对应的文件内容是 第一行 物体数量n 箱子尺寸C 第二行 用空格分隔的i个物体的大小 其中的数字都是整数，物体和箱子均不能分隔-Travel knapsack problem, the use of approximation algor