登录
首页 » Visual C++ » zuiyouerfenjiansuozhu

zuiyouerfenjiansuozhu

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

代码说明:

  最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(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.)

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

发表评论

0 个回复

  • duilie
    队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)
    2010-09-08 14:36:38下载
    积分:1
  • hafumanTree
    数据结构课程设计,在VC环境下完成,利用哈夫曼树原理,主要功能是实现字符的压缩和解压缩,设计脉络清晰,易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)
    2011-01-02 13:15:23下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • banker
    用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)
    2012-03-13 13:20:43下载
    积分:1
  • Tic-tac-toe-chess
    C语言实现井字棋博弈的过程,采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)
    2012-05-20 23:15:48下载
    积分:1
  • Graph
    采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
    2007-12-25 16:55:03下载
    积分:1
  • expression
    利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
    2011-10-30 14:14:01下载
    积分:1
  • classical-algorithm-VCPP
    常用的算法经典代码,包括快速排序,冒泡排序等各种排序方法,还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)
    2013-01-15 11:15:10下载
    积分:1
  • data-structure-paper
    本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
    2013-09-18 08:16:24下载
    积分:1
  • Huffman-Tree
    使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率,并据此构造Huffman树,编制Huffman 码;根据已经得到的编码,对01形式的编码段进行译码。 具体的要求: 1.将给定字符文件编码,生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码,生成字符,输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
    2015-05-22 15:37:03下载
    积分:1
  • 696518资源总数
  • 106242会员总数
  • 10今日下载