登录
首页 » C++ » chen-hui-lan(Data-Structure)

chen-hui-lan(Data-Structure)

于 2013-10-05 发布 文件大小:2224KB
0 177
下载积分: 1 下载次数: 1

代码说明:

  数据结构 课件 附PPT 附实现源码数据结构 课件 附PPT 附实现源码(Class data structure attached PPT courseware data structure to achieve source components attached attached attached PPT achieve source)

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

发表评论

0 个回复

  • MATHEMATICA 程序 最短路径算法
    MATHEMATICA 程序 最短路径算法-MATHEMATICA procedure shortest path algorithm
    2022-05-16 13:42:34下载
    积分:1
  • 1.[问题描述] 编写递归算法,计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g ....
    1.[问题描述] 编写递归算法,计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出,输出的结果为;dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点,然后建立其左右子树,直到空子树为止,中序遍历二叉树时,先遍厉左子树,后遍厉右子树,最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下: #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af
    2023-08-31 16:00:04下载
    积分:1
  • Online chat room system, this system development environment and myeclipse datab...
    网上聊天室系统,本系统采用myeclipse开发环境和sqlserver2000数据库。-Online chat room system, this system development environment and myeclipse database sqlserver2000.
    2022-10-25 16:45:03下载
    积分:1
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • 先验频繁项集挖掘
    这是 apriori 算法的数据挖掘工具。 c# 和.NET 2.0,很容易理解,您可以重写它,使它更有效率。
    2022-04-02 06:52:46下载
    积分:1
  • sesolution
    经典的二路归并算法,按照标准的教科书上的算法编写,好用实际()
    2018-03-14 23:40:16下载
    积分:1
  • Binomial coefficient computing] [Dev
    二叉树系数计算[DeV-C++学习],利用动态规划动态编程计算
    2022-02-01 00:21:29下载
    积分:1
  • huffman
    赫夫曼编码译码器:能对指定的文本文件进行各字符出现频度分析,并建立哈夫曼树与哈夫曼编码,将该文本文件编码成目标文件 (Huffman codec: Can the specified text file to the frequency analysis of characters in there, and the establishment of Huffman Tree and Huffman encoding, the encoded text file into the destination file)
    2009-12-23 13:59:39下载
    积分:1
  • 学生信息管理系统
    直接下载,用vc++6.0打开 可直接运行,数据库为access2003,语言为vc++,适合初学者 直接下载,用vc++6.0打开 可直接运行,数据库为access2003,语言为vc++,适合初学者
    2022-12-25 08:10:03下载
    积分:1
  • db .* (pronounced dee
    db.* (pronounced dee-be star) is an advanced, high performance, small footprint embedded database for open source operating systems.-db .* (pronounced dee-be star) is an advanc ed, high performance, small footprint embedded database for open sou rce operating systems.
    2023-07-22 00:35:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载