搜索资源列表
一个树控件在编译器语句显示中的应用
- 一个树控件在编译器语句显示中的应用程序。在开发编译器时,一个很重要的就是对语句结构进行显示。-Control in a tree compiler statement shows that the application procedures. The compiler development, a very important statement is the right structure shows.
Delphi在分形艺术中的应用
- Delphi在分形艺术中的应用(用delphi绘制分形树,全部代码,包括窗体)-Delphi fractal art in the application (with delphi fractal tree mapping, all the code, including the Form)
二叉树的各种遍历操作(非)递归
- 数据结构的基本应用,二叉树的遍历。适合初学者,比较简单。 -the basic data structure application binary tree traversal. For beginners, relatively simple.
排序二叉树的应用数据结构课程设计
- 排序二叉树的应用数据结构课程设计.自己用来交过学期的设计报告.用好了请评价.-sort of binary tree data structure course design. Their handed over a semester to design reports. Please use the commentary price.
Java二叉树的后续遍历
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要.-Java two following forks the tree traversal Java two following to fork the tree traversal mainly applies in goes against the Poland -like solution,Is very important in the translation
VC树型控件的应用
- VC树型控件的应用
数据结构中二叉树的应用
- 求所给二叉树每个节点的层次,从根到该节点的枝长(路径长度),子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。内含有详细代码说明。
arithmetic
- 常用算法:链表的操作、队列的应用、堆栈的应用、串的应用、树的基本操作、冒泡排序、堆排序、归并排序、磁盘文件排序、顺序查找、二分查找、树的动态查找、二分法求解方程、牛顿迭代求解方程、弦截法求解方程、拉格朗日插值、最小二乘法拟合、辛普生数值积分、改进欧拉法、龙格-库塔算法、高斯消去法、正定矩阵求逆算法-Commonly used algorithms: List of operation, the queue of applications, the stack of applications, t
TEST
- 数据结构试验 实验一 线性表的顺序表示与实现 实验二 线性表的链式表示与实现 实验三 栈与队列及其应用 实验四 二叉树的应用 实验五 图的遍历与应用 实验六 查找技术 实验七 内部排序 全部源码-Experimental test data structure form a linear sequence of that experiment and realization of the Second linear chain form and realizati
090619
- 理解二叉树特别是完全二叉树的性质,掌握二叉树的存储结构(二叉链表);熟练掌握二叉树的常用操作算法(初始化、插入结点、删除结点、遍历等);初步掌握二叉树的应用。-Binary tree in particular, to understand fully the nature of binary tree, binary tree master storage structure (List Binary) proficiency in commonly used binary tree alg
shujujiegoukechengsheji2
- 图的应用,二叉树的应用与操作为题目的数据结构课程设计。有详细的文字说明和源代码。-Map applications, application and operation of a binary tree data structure for the subject curriculum design. A detailed written instructions and source code.
HuffmanTree
- 二叉树-哈弗曼树的应用,键盘输入一连串的字符串,最好不要超过10个,回车后输出相应的频率,同时,根据左历变,按顺序输出频率的!!很简单-Binary Tree- Havermann Tree Application
BTree 二叉树的遍历与应用
- 二叉树的建立,前序中序后序遍历,线索化,递归非递归遍历,查找前驱或后继结点,输出,菜单实现。-The establishment of a binary tree, inorder preorder postorder traversal, threaded, non-recursive traversal recursion, find precursor or successor nodes, output, menu implementation.
掌握赫夫曼树建立方法及其在编码上的应用
- 实验目标:掌握赫夫曼树建立方法及其在编码上的应用-Experimental objectives: to master the Huffman tree building method and its application on the coding
掌握赫夫曼树建立方法及其在编码上的应用
- 实验目标:掌握赫夫曼树建立方法及其在编码上的应用-Experimental objectives: to master the Huffman tree building method and its application on the coding
赫夫曼树建立方法及其在编码上的应用
- 实验目标:掌握赫夫曼树建立方法及其在编码上的应用-Experimental objectives: to master the Huffman tree building method and its application on the coding
Huffman编码(二叉树应用)
- Huffman编码(二叉树的应用)其中包含了源代码及实验截图(Huffman encoding (Application of two fork tree) Which contains the source code and experimental screenshots)
二叉树遍历
- 二叉树遍历(Traversal)是指沿着某条搜索路线,依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 遍历是二叉树上最重要的运算之一,是二叉树上进行其它运算之基础。(Two tree traversal (Traversal) refers to a search line, in turn, each node in the tree to do once, and only a visit. The operation of the access nod
4、二叉树的应用
- 在计算机科学中,二叉树是每个节点最多有两个子树的树结构。本程序能够实现二叉树的创建、先序、中序、后序、层次遍历、计算高度等功能。(In computer science, a two tree is a tree structure with two subtrees at each node. This program can realize the creation of two binary tree, first order, middle order, backward order,
双树复小波
- 这是一个双树复小波的MATLAB的应用工具箱,里面包含了一维、二维复小波变换代码,可直接调用。(This is a dual tree complex wavelet MATLAB application toolbox, which contains one-dimensional, two-dimensional complex wavelet transform code, which can be directly invoked.)