搜索资源列表
综合实验哈夫曼编码
- 1．n个叶结点,权分别为w1,w2,• • • ,wn的二叉树中，带权路径长度WPL最小的二叉树叫最优二叉树， 也叫霍夫曼树。 2．霍夫曼算法：1）根据给定的权值{w1,w2,• • • ,wn}构造n个二叉树F={T1,T2,• • • ,Tn}每个Ti只有一个根结点，权为wi。2）在F中选取两棵根结点的权值最小的树 构成一棵新的二叉树，其根的权值为左右子树根的权值的和。3）F中删去这两棵树，加上新得
binarytreetranverse
- 用汇编实现二叉树的遍历,提示输入左右子树显示结果-compilation of achievement with the binary tree traversal, suggesting that the importation of sub-trees around results show
0005
- Tomes of Delphi: Algorithms and Data Structures by Julian Bucknall This book about Algorithms and Data Structures is a highly sophisticated title targeted for advanced developers. Author Julian Bucknall works for one of Inprise s leading and ol
mCh21
- matlab图像处理，在原始图像中选择的多边形区域及二进制mask图像，过滤前后的上衣商标显示，自定义的图像过滤操作，填充前后的trees图像-matlab image processing, in the original image selected regional and binary mask polygon images before and after filtration jacket trademark show that since the definition of ima
shujuku
- 单链表，二叉树，复杂表达式，图的课程设计。-Singly linked lists, binary trees, curriculum design is
CPPLabs-6-soluce
- Tutorial n°6 - Working with pointers, binary trees, recurs functions, and application to dictionary construction
binary_trees
- It is an assignment on binary trees using C++. It includes basic functions using binary trees likes sorting, reading from and writing on file and so on.
tree
- 树的基本实现及其应用，主要包括二分查找树，AVL树等-The basic realization of the tree and its applications, including binary search trees, AVL trees
project8.tar
- 由双亲表示法建立3棵树，将这些树表示的森林转换成二叉树，对二叉树进行线索化并遍历。-Law established by the parents said three trees, these trees will be converted into a binary representation of the forest for clues and binary tree traversal.
EZDSL200
- 栈、队列、列表、二叉树等数据结构,还不错-Easy classical data structures for Delphi 1-2 The EZDSL units provide an OOP interface for classical data structures for Delphi: stacks, queues, lists, binary trees and so forth. For programmers migrating from BP7 a TCollection
c
- 区间树，创建区间树，插入删除和搜索操作。 红黑树创建查询删除。 二分查找，多种排序方式实现，快速矩阵运算实现-Interval trees, create a range of trees, insert and delete search operation. Create a query remove red-black tree. Binary search, sorting various ways, matrix operations to achieve fast