登录
首页 » Visual C++ » 5100309203_5_8

5100309203_5_8

于 2012-12-16 发布 文件大小:883KB
0 336
下载积分: 1 下载次数: 3

代码说明:

  二叉树类的前序,后序,层次遍历,其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • linearlist
    说明:  线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)
    2011-04-07 14:08:14下载
    积分:1
  • Monkeys-and-peach
    Monkeys and peach,Monkeys and peach(Monkeys and peach)
    2013-09-01 22:06:42下载
    积分:1
  • 12
    说明:  c编写的链表连接函数,上课时学的,上传试试 (c write the list to connect function, class, learn, try uploading)
    2010-07-08 15:27:22下载
    积分:1
  • Six-degree-space
    中国大学MOOC-陈越、何钦铭-数据结构 解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure Solving report of the problem- 06-3 Six degrees space)
    2015-09-06 11:09:27下载
    积分:1
  • Bitree
    二叉树的打包数据结构,包括遍历,删除,添加,注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)
    2015-10-04 23:44:33下载
    积分:1
  • erchashu
    平衡二叉树操作,可以输入数字形成二叉树,可以进行添加、删除操作(Balanced binary tree operation, you can enter numbers to form a binary tree, the user can add, delete)
    2011-12-23 10:26:26下载
    积分:1
  • xiao-yuan-dao-you
    说明:  设计济南大学校园平面图,所含的景点不少于10个。以图中顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询,即查询任意两个景点之间的一条最短的简单路径。 选作内容: 求校园的关节点。 提供图中任意景点查询,即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息,如道路类别,沿途景色等级,一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )
    2011-03-21 19:54:06下载
    积分:1
  • NewCode
    清(英文)常见数据结构,代码实现,值得下载,值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)
    2012-11-21 14:33:49下载
    积分:1
  • Insert
    POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)
    2013-11-21 23:27:17下载
    积分:1
  • tanxinfangfa
    说明:  贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
    2006-05-15 21:50:01下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载