Search - binary AND tree

Search - binary AND tree - List

[Other resource] 二叉树1212 DL : 0: 建立二叉树，层序、先序遍历（用递归或非递归的方法都可以-establish binary tree, sequence, the preorder (with the recursive and non - recursive method can be
Date : 2008-10-13 Size : 1.79kb User : 速度风
[Other resource] 非常完美的二叉树模板 DL : 0: 非常完美地二叉搜索树模板～～～～希望大家能够喜欢，并且提出宝贵意见和建议-perfectly Binary Search Tree template ~ ~ ~ ~ hope that we can love and made valuable suggestions and recommendations
Date : 2008-10-13 Size : 17.03kb User : 李鹏
[Other resource] ID3算法源程序(C语言) DL : 0: ID3算法源程序。使用的方法是编写一个*.dat文件保存样本数据，还有一个*.tag文件保存属性列名，且最后一个属性是标号属性。运行是输入id3 文件名。输出格式是一个二叉判定树。-ID3 algorithm source. The method used was to prepare a document preservation *. dat sample data, a document preservation *. tag attributes listed, and the final one is the attribute label attributes. Running importation id3 file. Output format is a binary decision tree.
Date : 2008-10-13 Size : 4.74kb User : 小丁
[Other resource] 实验7 二叉树北京师范大学数学科学院 DL : 0: 自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the method, using the right expression Segmentation and recursive input, and this was also a Polish integrity of the conversion process, sound
Date : 2008-10-13 Size : 4.11kb User : 李铭璜
[Other resource] 平衡二叉树操作的演示 DL : 0: 平衡二叉树实现一个动态查找表,有三种基本功能:查找,插入删除,还有选项功能:合并两棵平衡二叉树,和分裂两棵平衡二叉树.-balanced binary tree to achieve a dynamic lookup table, there are three basic functions : to find, delete, insert, functional options : merging two balanced binary tree, and split two balanced binary tree.
Date : 2008-10-13 Size : 3.17kb User : 罗明会
[Other resource] 重言式 DL : 0: 用二叉树实现逻辑表达式的基本运算,包括逻辑与,或,非,还可以判别表达式是重言式,还是矛盾式.-binary tree using logical expressions of basic operations, including logic and, or, not, we can judge expression is tautology, or contradiction.
Date : 2008-10-13 Size : 2.72kb User : 罗明会
[Other resource] 先序建立树 DL : 0: 数据结构中，先序建立二叉树算法，在建树的基础上可以进行树的其他操作，思想简单易懂-data structure, the first order to establish a binary tree algorithm, the contribution on the basis of the tree can be conducted in other operations, thinking simple and understandable
Date : 2008-10-13 Size : 10.38kb User : emma
[Other resource] Leasen图的建立和DFS&BFS算法 DL : 0: 数据结构中关于DFS和BFS的练习，较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
Date : 2008-10-13 Size : 1.61kb User : 李立纯
[Other resource] 抽象数据类型实现 DL : 0: 二叉树抽象数据类型的实现问题说明：数据结构来实现二叉树具体函数功能的实现；以及相关操作。-binary tree abstract data types realization : data structures to achieve specific function in a binary tree the realization; , and related operations.
Date : 2008-10-13 Size : 2.92kb User : 张君
[Other resource] bisorttree00 DL : 0: 二叉搜索树：本程序可以实现二叉搜索树实现对数据的查找和排序-Binary Search Tree : The procedure can be achieved Binary Search Tree of data to search and sort
Date : 2008-10-13 Size : 4.26kb User : cds
[Other resource] threetrees DL : 0: 对三种数据结构的分析.avl tree,splaytree和binary search tree的插入和删除的算法复杂度分析.-of three data structure analysis. Avl tree, splaytree and binary search tree insertion and deletion algorithm complexity analysis .
Date : 2008-10-13 Size : 3.47kb User : 王佩君
[Other resource] shujujiegou__c++ DL : 0: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Date : 2008-10-13 Size : 141.56kb User : liulei
[Other resource] Binary_Search_Tree DL : 0: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Date : 2008-10-13 Size : 2.65kb User : liulei
[Other resource] tudelinjiebiaobiaoshi DL : 0: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Date : 2008-10-13 Size : 2.22kb User : liulei
[Other resource] Kruskal_suanfa DL : 0: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Date : 2008-10-13 Size : 2.94kb User : liulei
[Other resource] Binary__Tree DL : 0: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Date : 2008-10-13 Size : 8.58kb User : liulei
[Other resource] AVL___Tree DL : 0: c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Date : 2008-10-13 Size : 1.51kb User : liulei
[Other resource] 1500PrePosterous DL : 0: 此程序给出一个算法，用于计算当已知一个m叉查找树的先序和后序遍历序列后，存在多少种中序遍历可能。输入格式为m s1 s2，其中m表示m叉树，例子 2 abc cba 结果为4 2 abc bca 结果为1 10 abc bca 结果为45 13 abejkcfghid jkebfghicda 结果为207352860-this procedure is an algorithm, When used in the calculation of a known m Binary Search Tree and the first sequence after sequence preorder, the existence of the number of species may preorder. Input format for s1 s2 m, m m-tree said, Example 2 abc cba results abc bca 4 2 1 10 results for the abc bca results for a 45 13 bejkcfghid jkebfghicda results 207352860
Date : 2008-10-13 Size : 7.42kb User : 姚秋林
[Other resource] SortTree DL : 0: 创建一棵二叉排序树，并采用中序遍历和层次遍历法输出其顶点序列，主要实验内容如下： 1. 定义二叉排序树的结构BiTree； 2. 编制二叉排序树的插入算法：void Insert_SortTree (BiTree ST, ElemType x)； 3. 编制中序遍历函数； 4. 在main()函数中完成二叉排序树的建立，以及中序遍历的输出。（二叉排序树的各个元素从键盘输入，并利用Insert_SortTree()函数进行插入建立）； 5. 编制层次遍历函数，并在main()函数中完成层次遍历的输出。层次遍历法要利用“队列”来实现；为此需要定义一个队列结构（可以采用链队列，也可以采用循环顺序队列），并实现相关的队列函数。 -create a binary sort tree, and used the preorder and output levels traversal sequence its peak, the main contents are as follows : 1. Sort definition of two fork BiTree tree structure; 2. Ranking compiled binary tree insertion algorithm : void Insert_SortTree (BiTree ST ElemType x); 3. establishment preorder function; 4. in the main () function to complete binary tree in order to establish, and the Central preorder output. (2 forks ranking tree various elements from the keyboard input, and the use of Insert_SortTree () function to insert the establishment); 5. Traversing the preparation level functions, and the main () function to complete traverse the output level. Level traversal to using "queue" to achieve; This requires definition of a cohort structure (Queue chain can be use
Date : 2008-10-13 Size : 14.89kb User : 段苛苛
[Other resource] BST BBT DL : 0: 数据结构大型作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!" / "NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Date : 2008-10-13 Size : 3.94kb User : 洪玲叶

« 12 3 4 »