搜索资源列表
decare_tree
- 有一种特殊的二叉树被称为笛卡尔树,这种二叉树的每个结点都有两个关键码,记为key1和key2。现在给你一组关键码,每组关键码用二个整数表示,要求构造一棵同时满足下列两个性质的笛卡尔树: 只考虑这棵笛卡尔树的第一关键码,它是一棵排序二叉树。 只考虑这棵笛卡尔树的第二关键码,它们满足类似于最小堆的性质,即任意一个父结点的第二关键码都比它的子结点的第二关键码小。 -There is a special kind of binary tree is called Cartesi
Java
- 本书提供了学习经典数据结构和算法的新方法。通过带有完整工作代码的详细示例清晰、透彻地解释了全书内容。掷骰子、纸牌和棋盘游戏提供了大量新颖、迷人的示例。. 本书首先透彻介绍了面向对象程序设计。利用这些工具,读者可以深入探究线性数据结构、算法(包括渐近表示法和递归)、树、集合和高级主题,如图和内存管理。 另外,页面清晰,一般在网上购买需要50多元人民币,可以为银子不充分的程序爱好者提供学习资料-This book provides a data structure of the clas
CreateHuffmanTree
- 最优二叉树或哈夫曼树 在权为wl,w2,…,wn的n个叶子所构成的所有二叉树中,带权路径长度最小(即代价最小)的二叉树称为最优二叉树或哈夫曼树。-Optimal Huffman tree or trees in the right for wl, w2, ..., wn are the n-leaf binary tree consisting of all with the right to a minimum path length (that is, the minimum pri
vv
- 线性表的应用 haffman树和haffman编码 构造平衡二叉树的源码-Application of linear haffman Table haffman coding trees and balanced binary tree structure of the source
tree
- 给定一组值,建立一棵二叉树,求二叉数的树深。-Given a set of values, the establishment of a binary tree, and the number of binary trees deep.
Arbori_AVL
- I have uploaded a project that implements AVL trees, and the programming language is LISP.
ds_baogao
- 哈夫曼编码与解码演示程序 1、 从初始界面中给出的信息选择相应功能; 2、 从终端读入字符集大小n,以及n个字符和n个权值。建立huffman树,并将它存于文件hfmtree.dat中 3、 利用已经建好的huffman树对文件tobetran.dat中的正文进行编码,然后将结果存入文件codefile.dat中; 4、 利用已经建好的huffman树将文件codefile.dat中的代码进行译码,结果存入文件textfile.dat中; 5、 将文件codefile.dat
J2meUI
- 提供多种美观UI,包括表格、目录树、图表等-Provides a wide range of beautiful UI, including tables, directory trees, charts, etc.
type
- 使用lex和yacc生成简单的编译器,生成语法分析树、完成类型检查等功能-The use of lex and yacc to generate a simple compiler, syntax analysis generated trees, the completion of type checking and other functions
mTree
- 快速、小巧、功能强大的树 var tree=new Tree("根节点") var nodei=new TreeNode("节点1") tree.appendChild( nodei ) tree.expandAll() 支持checkbox 一个页面可以有多个树,代码干净 现在在公司的项目中广泛应用-Fast, compact and powerful tree var tree = new Tree ( " root" ) var
java
- 数据结构java描述,链表,栈,队列,图,树-Java data structure descr iption, linked lists, stacks, queues, maps, trees,
Mastering.Algorithms.with.C
- Data comes in all shapes and sizes, but often it can be organized in the same way. For example, consider a list of things to do, a list of ingredients in a recipe, or a reading list for a class. Although each contains a different type of data, they a
search_algo_for_B+_trees
- search algorithm for B+ trees
dTREE
- 经典的数据挖掘算例的代码,生成决策树,可看到生成树的规则。-Classic example of data mining code, to generate decision trees can be seen spanning tree rules.
9
- B TREES.. SIMPLE AND EFFICIENT.
heffuman
- 通过建立赫夫曼树,将码元如“ABC”编码成 “011001”形式,也可通过此赫夫曼树进行译码,而且编码形式为最小生成树形式,即在有权值情况下编码长度最短。-Through the establishment of Huffman trees, will be key element such as " ABC" code as " 011001" form can also be carried out through the Huffman decodi
Fractal_Image
- 分型曲线的绘制,包括三角形,分形树的绘制及曲线等。-Curve classification, including the triangle, fractal trees, such as mapping and the curves.
2352
- 线段树和树状数组的运用,ACM知识,该题为poj 上的2352题的详细代码-An array of trees and tree line use, ACM knowledge, which entitled the 2352 title poj detailed code
2777
- 线段树和树状数组的运用,ACM知识,该题为poj 上的2777题的详细代码-An array of trees and tree line use, ACM knowledge, which entitled the 2777 title poj detailed code
BinaryTrees
- Binary trees super tutorial. All ur tree concepts cleared.