Search - 2-3 tree

Search - 2-3 tree - List

[Other] P2Particle DL : 0: 1、P2P匿名通信系统用户激励机制的研究与设计 2、P2P系统一致性及查询问题研究 3、对等网络有效资源搜索技术及其应用研究 4、基于IP地址的拓扑相关P2P网络 5、基于数据转发树的P2P网络搜索研究-1, P2P anonymous communication system users incentive mechanism and design of the two studies, P2P system consistency and inquiries Study 3, and other network resources to effectively search technology and its application 4, Based on the IP address of the peer-to-peer network topology-5, based on data transmitted tree search P2P network research
Date : 2008-10-13 Size : 3.31mb 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 : 苏言暖