登录
首页 » Visual C++ » Binary-tree-in-the-establishment

Binary-tree-in-the-establishment

于 2013-03-30 发布 文件大小:833KB
0 216
下载积分: 1 下载次数: 1

代码说明:

  二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)

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

发表评论

0 个回复

  • binary-search
    此代码为折半查找算法,适用于有序表,欢迎各位下载(This code is the binary search algorithm for ordered lists )
    2011-07-06 15:50:17下载
    积分:1
  • Cpp1
    校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
    2012-06-20 21:57:32下载
    积分:1
  • 3_abstract_data_struct
    数据结构:抽象数据类型的介绍;讲述如何构造函数和如何实现;(Data structure: the introduction of abstract data types on how to structure function and how to achieve )
    2008-04-14 22:56:33下载
    积分:1
  • 约瑟夫环的循环链表实现
    约瑟夫环的循环链表实现,这个程序比较完整,有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)
    2005-07-03 19:38:38下载
    积分:1
  • ALGraph
    学数据结构自己总结的东西,希望对大家有所帮助。(Learn data structure sum things up, we want to help.)
    2013-03-08 19:50:18下载
    积分:1
  • adms
    阿当姆斯显式和隐式求解方法,用四阶龙格库塔作为起始,然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中,方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)
    2012-06-09 11:27:18下载
    积分:1
  • ds3
    单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作: (1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。 (源代码:ds3-1.c) (2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。 (源代码:ds3-2.c) (3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。 (源代码:ds3-3.c) (4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。 (源代码:ds3-4.c) (5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。 (源代码:ds3-5.c) (6)在给定的单链表的第i位上插入值为n的节点。 (源代码:ds3-6.c) (7)在给定单链表的值为m的节点的前面插入一个值为n的节点。 (源代码:ds3-7.c) (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )
    2014-05-11 19:19:41下载
    积分:1
  • a
    说明:  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)
    2010-11-19 23:24:18下载
    积分:1
  • permutations
    组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
    2011-12-12 10:51:16下载
    积分:1
  • yuesefu
    数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)
    2012-12-02 16:23:02下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载