资源列表
ThreadBinaryTreeFindnextorFindprev
- 创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose
tudeshengdubianli
- 图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship
xianxuxunhuan
- 二叉数先序循环的非递归实现，一般先序循环都是由递归实现的，按照完全二叉树格式输入字符型结点值-binary sequence a few first cycle of non - recursive, the general first order recursive cycle are achieved, In accordance with the format completely binary tree node input character values
bubble__sort
- 一个很好的bubble sort 程序-a good bubble sort procedures.
car1111111
- 一个有趣的算法。。。十分有趣-an interesting algorithm. . . Very interesting
GetCPUAndDisk
- 得到cpu的序列号和硬盘的徐蕾好，并且简单的加密的算法！-be cpu sequence and the hard drive Xu Lei good and simple encryption algorithm!
p-7
- 一个实现对学生成绩输入，修改，排序的算法，我们的一个设计，和大家一起分享吧！-a pair of students achieving results import, modify, scheduling algorithms, we have a design, and share with everyone!
ruinian
- 一个判断输入的一个时间是否为瑞年的简单算法，也于大家分享吧！-a judgment entered a time for the Swiss, a simple algorithm, but also to share with you!
zsum
- 给定n 个整数a ,a , ,an 1 2 组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1 为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2
dia
- 给定n 个整数a ,a , ,an 1 2 组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1 为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2
graph11
- 城市之间的最短路径，用于求任意两个城市之间的最短路径-cities in the shortest path for the two cities arbitrary seeking the shortest path between
JudgeBinaryTree
- 一个构建、显示和判断完全二叉树的小程序。-a building, display and complete binary tree judgment of small procedures.