Search - binary AND tree

Search - binary AND tree - List

[Other] 二叉树的创建及先序、中序、后序遍历 DL : 0: 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
Date : 2008-10-13 Size : 29.37kb User : 陆营
[Other] 二叉树jian DL : 0: 这个程序采用先序建立二叉树，并分别使用递归和非递归算法实现了对该二叉树的先中后序的遍历输出，并给出了一定的使用说明-this procedure was used in order to establish a binary tree respectively, and the use of recursive and non - recursive algorithm of this binary tree after the first sequence which Ergodic output, and gives a certain degree of use
Date : 2008-10-13 Size : 14.4kb User : 杨正朋
[Other] exmp3_15 DL : 0: 设计一个应用程序能将一组整数数据按由小到大的顺序存放在一个连续的整数表（顺序表）中，并能以该顺序表生成一棵二叉树用于存放有序表中元素-design an application can a group headed by integer data stored in the sequence of consecutive integers a table (Table sequence), and be able to generate the sequence table for a binary tree stored in an orderly Table of Elements
Date : 2008-10-13 Size : 13.31kb User : alex
[Other] C_data_structure DL : 0: 清华出版社出版，严蔚敏和吴伟民编写的，C语言版数据结构参考程序，有线性表、栈和队列、串、数组和广义表、树和二叉树、图、动态存储器、查找-Tsinghua University Publishing House, Yan Wei-min and Xiulan WU Weimin prepared by the C language version of the reference program data structure, linear scale stack and Queue, strings, arrays and generalized form, tree and binary tree, graphics, dynamic memory, you
Date : 2008-10-13 Size : 41.27kb User : fanyan
[Other] TestMatrixOperation DL : 0: 在java环境中，二元多项式计算完成计算并演示结果以及以二叉树形式进行存储-the environment, complete binary polynomial terms calculated and results of the demonstration in the form of binary tree storage
Date : 2008-10-13 Size : 1015byte User : 吴昊
[Other] ExpressionBinaryTree DL : 0: 表达式二叉树的实现。输入任意一个前序中序或后序表达式，可生成对应的表达式二叉树并树状打印，之后用户可以选择以前序中序或后序将表达式再次输出。-expression of the realization of a binary tree. An arbitrary input before the order or sequence after sequence expressions, which will generate the corresponding binary tree and the tree expression Print, after users can choose before the order or sequence after sequence of expression of a recurrence.
Date : 2008-10-13 Size : 1.98kb User : myfaint
[Other] fuTree DL : 0: 一个比较全的关于二叉树的操作的程序，包括树的建立，遍历，求深度，节点计算和销毁。-a more complete binary tree on the operating procedures, including the establishment of the tree, traverse, seeking depth Node calculation and destruction.
Date : 2008-10-13 Size : 2.44kb User : 傅蓉蓉
[Other] sjjgys DL : 0: 各种数据结构和算法演示（顺序表，链表，二叉树，图，动态查找，广义表，串，存储管理等）-various data structures and algorithms Demo (chronology, linked list, binary tree, graphics, dynamic search, generalized table, string, Storage Management)
Date : 2008-10-13 Size : 2.38mb User : 荣荣
[Other] erchashusuanfalunwen DL : 0: 二叉树的算法毕业论文，赶快下啊，需要毕业论文的。-binary tree algorithm dissertation and quickly under ah need the dissertation.
Date : 2008-10-13 Size : 10.39kb User : 吴宏斌
[Other] tchf DL : 0: 本程序运用哈夫曼编码原理对数据进行二进制编码压缩。进入界面要求输入进行编码的数据，注意输入的数据彼此不能相同。然后，敲回车将显示数据排序信息及表示二进制形成的二叉树。敲回车显示字符和对应二进制编码。键入？显示帮助信息。键入#进行编码数据输入与二进制数据输入的切换。键入tree显示图形二叉树。键入huff显示编码信息。键入reset刷新缓冲区，重新输入要求编码的数据。键入exit退出程序。在TC2.0上运行。注意正确配置图形驱动路径。-the procedures used Huffman coding theory of binary coding for data compression. Access interface for the importation of coding data to input data with each other not the same. Then, the knockout round will show information and data sorting said binary formation of binary tree. Knockout round display character and the corresponding binary coding. Type? Information shows that help. Type # encode binary data entry and data input switching. Type tree display graphics binary tree. Type huff show coding information. Type reset refresh buffer and re-importing the data coding requirements. Type exit to withdraw from the process. TC in running. Pay attention to the correct allocation of graphics-driven pathways.
Date : 2008-10-13 Size : 37.5kb User : 孔铁柱
[Other] TREEBINA DL : 0: 计算器程序。能够显示计算优先级的二叉树。可以任意加括号。可进行+_*/％运算，及sin,cos,tan,cot,^,ln,e^,a^运算。运行于TC2.0。要求正确配置图形驱动程序。-calculator program. Calculated to demonstrate the priority of binary tree. Can be arbitrary bracketed. Can be _ * /% Operational and sin, cos, tan, cot, ^, ln, e ^ a ^ operator. Running TC. It demands the right graphics drivers.
Date : 2008-10-13 Size : 2.13kb User : 孔铁柱
[Other] genBST DL : 0: 通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.
Date : 2008-10-13 Size : 16.03kb User : 雷剑
[Other] E51_0230 DL : 0: 一:需求分析 1．本程序需掌握树和二叉树的概念及工作原理，运用其原理及概念完成实验.。 2．问题描述：一个逻辑表达式如果对于其变元的任一种取值都为真，则称为重言式；反之，如果对于其变元的任一种取值都为假，则称为矛盾式；然而，更多的情况下，既非重言式，也非矛盾式。试写一程序，通过真值表判断一个逻辑表达式属于那一类。 3．基本要求：（1）逻辑表达式从终端输入，长度不超过一行。逻辑运算符包括“|”，“&”和“~”, 分别表示或、与和非，运算优先程度递增，但可以有括号改变，即括号内的运算优先。逻辑变元为大写字母。表达式中任何地方都可以含有多个空格符。（2）若是重言式或矛盾式，可以只“显示True forever”或“False forever”，否则显示“Satisfactible”以及变量名序列，与用户交互。若用户对表达式中变元取一组值，程序就求出并显示逻辑表达式的值。 -1 : a needs analysis. The process required the trees and the binary tree master the concept and principle, to use its principles and the concept of completion of the pilot. . 2. Problem description : If a logical expression for the changes in the yuan's value for a true, as tautology; Instead, If the changes for the yuan's value for a fake, then called the contradiction; However, the more the situation, neither tautology. is not a contradiction. Try to write a procedure for the adoption of a truth table judgment logical expression belong into that category. 3. Basic requirements : (a) logical expression from the terminal input, not longer than his. Logical Operators including "|","
Date : 2008-10-13 Size : 60.92kb User : 苏言暖
[Other] E64_0230 DL : 0: 平衡二叉树操作的演示一、需求分析（1）利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。（2）初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。（3）重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Insert the available balance transform inverse transform.
Date : 2008-10-13 Size : 40.51kb User : 苏言暖
[Other] huffman DL : 0: 课程设计：任务：建立最优二叉树函数。要求：可以建立函数输入二叉树，并输出其赫夫曼树。 -Course Design : Mission : To establish the optimal binary tree function. Requirements : function can be established Binary Tree imported and exported its Hefuman tree.
Date : 2008-10-13 Size : 2.02kb User : 赵辉
[Other] erchashu DL : 0: 建立二叉树，统计二叉树中度为2的结点个数和叶子结点个数（用递归或非递归的方法都可以，先序、中序或后序均可）-establish binary tree, Statistics for the two binary tree to moderate the number of nodes and the number of nodes leaves (with the recursive and non - recursive method can be first order, After the order or sequence may)
Date : 2008-10-13 Size : 811byte User : ahui
[Other] 二叉树改进041123 DL : 1: 输入结点和结点数生成二叉树，可以左遍历，右遍历，后遍历！-input nodes and nodes generate binary tree can traverse left and right traverse, traverse after!
Date : 2008-10-13 Size : 16.79kb User : 吴丹