资源列表
3.37
- 此程序为求两个数的约数,将他们输出,将这两个数的最大公约数输出 -procedure for the sake of a few two about a few of their exports, the number of these two majors output
ListLink
- 数据结构单链表的实现,包含链表元素的删除,查找,插入-single linked list data structure to achieve List contains elements delete, retrieve, insert
1969
- 北大ACM1969（Count on Canton） -North ACM1969 (Count on Canton)
1003
- 北大ACM1003（Hangover）-North ACM1003 (Hangover)
1455
- 北大ACM1455(Crazy tea party)-North ACM1455 (Crazy tea party)
1005
- 北大ACM1005(I Think I Need a Houseboat)-North ACM1005 (I Think I Need a Houseboat)
cengxubianlierchashu
- shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用，所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedure
E23_0310
- 火车调度,学得还不错,跟大家一起分享.不过不是自己写的-train, we learn was pretty good, to share with you. But it is not that he wrote
operate
- 1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal
tree-leave
- 中序遍历输出二叉树 输出二叉树的叶子树 输出二叉树的节点数-which preorder output binary tree output binary tree leaf tree output binary tree nodes
zhan-op
- 栈的操作与应用 定界符配对检查 中缀转后缀并求值-stack operation and application delimiter matching inspection superintendent to seek value and Suffix
tree-op
- 前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历-Preorder clues before the binary tree traversal sequence which leads the order of the binary tree traversal sequence clues after the binary tree after preorder