搜索资源列表
poj1990
- poj上第1990题目源码，用到了2个树状数组，这题数据结构是关键，想到了题目就很简单了-poj first topic FOSS 1990, used the two tree arrays, which that data structure is the key, think of a very simple topic
optimizationdimidiatesearches
- 这个程序可实现最优二分检索树的构造，绘制和检索，请在Turboc 2.0下运行-this procedure can be sub-optimal two tree structure retrieval, mapping and retrieval, Please run using Turbo 2.0
最优二分检索树构造及绘制
- 这个程序可实现最优二分检索树的构造，绘制和检索，请在Turboc 2.0下运行。-this procedure can achieve optimal two-tree structure retrieval, mapping and retrieval, please Turbo running under 2.0.
最优二分检索树构造及绘制
- 这个程序可实现最优二分检索树的构造，绘制和检索，请在Turboc 2.0下运行-this procedure can achieve optimal two-tree structure retrieval, mapping and retrieval, please run Turbo 2.0
the_tree.rar
- matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。,matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
two
- 构造一个二叉树的基本算法，使用C编程，调试通过。-Construct a basic binary tree algorithm, the use of C programming, debugging through.
deepLook
- 深度遍历一个二叉树，以读取结点的有关信息-read the data the connection of the two tree in a deep looking way
wideLook
- 为了读取二叉树的结点数据，广度遍历二叉树-Read the information of the connection of the two tree in a wide Looking way
huffmanbianmayimaqi
- 构造每个字符的哈夫曼编码,选出树中两个权值最小的结点-Construction of the Huffman coding for each character, the right to elect two tree node the smallest value
draw-tree
- 伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.-The tree is drawn in such a way that both of the edges
xrun
- 数据结构之任意多叉树的建立和操作，包括先序，中序，层序，和插入节点，统计树信息。 融入了树，双向队列等经典数据结构的使用模式。-Data structure of any multi-branch tree establishment and operation, including the first order, in sequence, sequence, and insert the node, the tree statistics information. Into the tr
two
- 二叉树算法的实现，能够迅速让符合这种算法的计算迅速实现-Binary tree algorithm that can quickly meet the requirements of this algorithm allows rapid calculation
S020600210
- « 问题描述： 有时需要测试2 个数据结构的同构性，即2个同构的结构在相应的位置具有相同结点数 和分枝数。试设计一个递归函数用于测试2 棵二叉树是否同构。 « 实验任务： 对于给定的2 棵二叉树，计算这2 棵二叉树是否同构。-« Descr iption of the problem: sometimes need to test two data structures of the same configuration, that is, the
KRUSKAL
- * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o
twotree
- 简单的二叉树遍历 链表形式-two tree
tree
- 按先序遍历的扩展序列建立二叉树的存储结构 二叉树先序、中序、后序遍历的递归算法 二叉树中序遍历的非递归算法 二叉树层次遍历的非递归算法 求二叉树的深度(后序遍历) -By first traversing the expansion of the storage structure of binary sequences to establish the first order binary tree, in order, after traversing a binary
AVL-Tree
- AVL tree - is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one
tree
- 数据结构树的演示程序，包括等价类合并、二叉树基本操作的实现、哈夫曼树、线索二叉树、前、中缀二叉树、表达式求值等程序。- The tree data structure demo program, including the equivalence class combination, two tree basic operations to achieve Huffman tree, binary tree, two clues, and two binary tree, infix
Balanced Binary Tree
- 平衡二叉树源代码 二叉树的格式化输出 可执行文件(Balanced two fork tree source code Two tree formatted output)
two tree
- 本程序中通过C++平台，实现二叉树的链式存储、遍历。(This procedure through the C++ platform, to achieve the two tree chain storage, traversal)