登录
首页 » Visual C++ » BiTree

BiTree

于 2008-01-11 发布 文件大小:2KB
0 195
下载积分: 1 下载次数: 7

代码说明:

  二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

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

发表评论

0 个回复

  • xianxingbiao
    另外一个可以实现线性表的程序,简单的操作,值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)
    2007-12-07 20:20:32下载
    积分:1
  • ALGO3-9
    用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)
    2008-07-02 02:41:08下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • test
    矩阵运算器,c语言编程,数据结构,免费下载(Matrix calculator, c language programming, data structures, free download)
    2008-05-04 09:32:59下载
    积分:1
  • prim
    普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
    2012-05-17 09:11:15下载
    积分:1
  • example-program
    里面有50例经典算法,其中包括水仙花素,兔子的繁殖等古典问题的求解(There are 50 cases of classic algorithms, including daffodils prime, rabbit breeding classical problem solving)
    2013-02-03 11:14:12下载
    积分:1
  • Maze_Engine
    数据结构一书上 关于迷宫游戏的算法 (Book on data structure algorithms on maze game)
    2010-06-12 09:47:17下载
    积分:1
  • HEAP
    poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
    2013-11-21 23:03:15下载
    积分:1
  • ecs
    说明:  二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)
    2011-03-26 11:59:58下载
    积分:1
  • labyrinth
    迷宫问题c源代码,大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标,输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
    2010-12-19 23:31:36下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载