资源列表
week5-B
- 找出走出迷宫的路径,并以坐标形式输出路径-find a way in the maze
epoll
- 用纯C实现的poll使用的方法以及注意事项-Poll using the method implemented in pure C Note
tree-and-bi-tree
- 利用栈对二叉树进行先根次序遍历的非递归算法-Non-recursive algorithm stack first root order traversal of a binary tree
stack-and-queue
- 栈的存储结构及其基本操作、队列存储结构及其基本操作-Stack storage structure and its basic operations, queue storage structure and its basic operation
acm
- 内有acm的一些算法，如johnson 算法、radix tree、动态规划、几何-There are some acm algorithm, such as johnson algorithm, radix tree, dynamic programming, geometry, etc.
1st
- 简单算术表达式的求解 完成标准中缀算术表达式求值运算-Solving of simple arithmetic expressions to complete the standard infix arithmetic expression evaluation operations
splaytree
- 从自顶向下和自下向上两种方法实现了伸展树的全部功能 如插入 查找 删除 合并 分裂-Tree stretching from the top-down and bottom-up are two ways to achieve all of the features, such as the insertion Find deleted merger split
splay
- 利用伸展树完成对数列的维护 包括插入删除翻转求最大子序列和 任意位置后n个位置和等功能-Stretch tree complete after a series of maintenance, including to insert delete Flip seeking the largest sub-sequences and anywhere n positions and other functions
main
- 数据结构中查找的一些源代码包括排序二叉树平衡二叉树B树等-Data structure to find some source code including sorted binary tree balanced binary B-tree
tree_completely
- 二叉树的总结 -构造链式二叉树&查找二叉树中某节点&求深度（高度， 层数）前序，中序， 后序遍历（递归， 和非递归）&求出二叉树所有节点总数-Summary of binary tree- the constructed chain binary tree & Find a node in the binary tree & seek depth (height, number of layers) preorder, inorder, postorder traversal (
bitree
- 二叉树的各种操作，插入、删除、统计深度、各层宽度、结点度为0、1、2的个数、先序、中序、后序遍历的递归以及非递归算法、层序遍历等操作-Binary tree operation, insert, delete, statistical depth layers width operation
selectsearch
- 选择排序例程,使用vs2010开发平台开发-Select sort routines, using vs2010 development platform