搜索资源列表
SUMEYYEKOC
- How Trees Creates in C++ this very efficent sample
tree
- 包括树的构造，树和二叉树的转换，树的各种遍历，以及用二叉树计算算术表达式，构造、计算中序表达式，中序表达式转前序表达式等~！ -Including the tree structure, trees and tree transformation, tree traversal of the various, and the tree calculated using the arithmetic expression, construction, calculation sequence ex
Gizmoball_demo
- 基于JAVA的跳球游戏，小球碰到障碍物如木条和壁后会反弹回去-JAVA based on the jump ball games, ball over obstacles such as trees and walls will bounce back
phpxml
- 关于php和xml的书，格式为chm，是学习php于xml的选择-XML and PHP is a clear, concise guide to the synergies between XML and PHP, many of which are not immediately visible to intermediate developers. XML and PHP demonstrates how PHP and XML can be combined to build cutti
2808
- poj 2808 校门外的树 简单计算题-poj 2808 trees outside schools to easy calculation problems
ercahshu
- 树型结构和现实中的具有层级特点的问题的解决有很大关系,但并不局限于此.至于应用实例,可以有所谓二叉排序,查找算法,还有比如哈弗曼树等等.本ppt详细的介绍了二叉树结构，遍历等问题。 -Tree structure and the reality of the characteristics of the problem with the level there is a great solution, but not limited to this. As for example, you
main
- If a tree falls in the forest, and there s nobody there to hear, does it make a sound? This classic conundrum was coined by George Berkeley (1685-1753), the Bishop and influential Irish philosopher whose primary philosophical achievement is the advan
145
- 使用51汇编程序编写的树和图的程序，程序简单明了，比较适用-Procedures used to prepare a compilation of 51 trees and plans, procedures easy to understand, compare the application of
tree_0000
- 二叉树有一个优雅的递归指针结构，所以他们是一个很好的学习方法递归指针算法。 - Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms.
ch06
- 我們的注意焦點要轉到搜尋樹（search tree）了，要深度討論兩種標準的樹結構（tree structure），就是本章所要說明的二元搜尋樹（binary search tree）以及下一章所要討論的 AVL 平衡樹（AVL tree）。這兩種樹其資料都依序排列的，它們之間的差別只在於 AVL 是一種平衡樹，而二元搜尋樹卻不是。-We want to focus the attention of the search tree (search tree), and want to discu
Tree
- 多线程画树,在多线程的同步与异步中，线程互相不干扰出错，画出的树-Multi-threaded draw trees, many at the synchronous and asynchronous threads, the threads do not interfere with each other is wrong and draw the tree
Huffmatreeofdatastructure
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。-Huffman tree is also called the op
Huffmanencoderdecoder
- 在发送端通过一个编码系统对待传输数据编码. 在接收端将传来的数据进行译码. 一个完整的系统应具有以下功能: (1)初始化.从终端读入字符集大小,以及字符和权值,建立 哈夫曼树,并保存. (2)编码.利用以建好的哈夫曼树对正文进行编码,然后保存. (3)译码.利用已建好的哈夫曼树将文件中的代码进行译码,结果打印出来. -At the sending end through a coding system for encoding transmit data treat
TwoTreeSynchronization
- Asp.Net 实现带选框的两棵树之间的增加，删除，转移-To achieve with Asp.Net box between the two trees to add, delete, transfer
Binary_Tree
- Binary_tree.cpp ：执行文件生成所有二叉树 这样做的目的C + +程序是产生所有二叉树指定节点数目。 基本思想是衍生所有二叉树基于退化树。 该算法的动机是圆括号法则代表二叉树。 一组括号可通过字典秩序排列，由此也可以产生二叉树。但该算法代码中并没有简单地转换括号代表性 它一直在改变过去的节点从最新二叉树下一可能位置（在这里，我们假设右向是正确的退化树方向） 。 该文件还提到计算机内存时（读/写）和avarage参考值。 这个工程在Microsof
hafumanshu
- 哈弗曼树和哈弗曼编码的源程序，很强大数 据结构上-哈弗曼trees and哈弗曼the source code, it is a powerful data structure d
SkipList
- SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.
Trees
- Tree datastructures programs- Tree datastructures programs...
avlIndex
- avl平衡二叉树和索引树的结合体!做成了一个头文件形式.用的时候要自己写个主函数调用-avl trees and a combination of the index tree!
PRACTICASEDA
- Code examples in Java about functions, trees, graphs and abstracts data types.