Search - binary AND tree

Search - binary AND tree - List

[Other] Tree+Postorder DL : 0: 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
Date : 2026-01-01 Size : 1kb User : xsfh9
[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 : 2026-01-01 Size : 307kb 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 : 2026-01-01 Size : 40kb User : 苏言暖
[Other] avl DL : 0: 数据结构的平衡二叉树的操作，包括插入和删除，查找-Balanced binary tree data structure of the operation, including insert and delete, search
Date : 2026-01-01 Size : 8kb User : lj
[Other] ORDERTRE DL : 0: 在turbo C 环境下运行调试成功实现二叉排序树和排序树的查找-In turbo C debugging environment to run the successful implementation of binary sort tree and sorting the search tree
Date : 2026-01-01 Size : 1kb User : 孙晓洁
[Other] Tree DL : 0: 演示二叉树的生成及一些常用操作；包括插入节点，删除节点等。-Demonstration of the generation of binary tree and a number of commonly used operations include insert node, delete node and so on.
Date : 2026-01-01 Size : 3kb User : Alex
[Other] btree DL : 0: 二叉排序树：对随机生成的一些数构建二叉排序树，并给出该二叉排序树的中序遍历二叉排序树或是空树，或是具有下属性质的二叉树：其左子树上所有结点的数据值均小于根结点的数据值；右子树上所有结点的数据值均大于或等于根结点的数据值；左子树和右子树又各是一棵二叉排序树。在二叉排序树中，若按中序遍历就可以得到有小到大的有序序列。 -Binary Sort Tree: The number of randomly generated number to build binary sort tree, and gives the binary sort tree traversal of the binary sort tree or the empty tree, or the nature of the binary tree with subordinates: Its left sub-tree nodes of all data values are less than the root node of the data values right sub-tree nodes of all data values are greater than or equal to the value of root node of the data left subtree and right subtree also each is a binary sort tree. In the binary sort tree, if in the sequence by the traversal can be a small to large and orderly sequence.
Date : 2026-01-01 Size : 1kb User : k332
[Other] wxc_BSTree DL : 0: 数据结构算法（C++实现）二叉搜索树的类定义和实现-Data Structure Algorithm (C++ Achieve) binary search tree of the class definition and realization of
Date : 2026-01-01 Size : 3kb User : 吴强
[Other] 2 DL : 0: 利用递归和非算法实现二叉排序树，并完成各种功能-The use of recursive algorithms and non-binary sort tree, and complete the various functions
Date : 2026-01-01 Size : 2kb User : 谭同学
[Other] lzh DL : 0: 本软件是在VC++来编译,在VC++的平台下运行,运行界面是黑色屏幕,本软件是实现最优二叉查找树结点的基本操作,在执行结果的屏幕下首先输入树的结点值以-1作为输入结束,然后选择要进行的操作,选择一是显示最优二叉树,选择二是插入一个结点,选择三是查找一个结点,选择四是删除一个结点.在选择各个操作后屏幕会提示要不要继续进行(Y/N),选择Y是继续操作,选择N是退出操作.本软件界面简单,容易操作,提示语句都采用中文,简单易懂.-This software is VC++ To compile, in VC++ Platform run, run interface is a black screen, this software is to achieve optimal binary search tree node of the basic operation, in the implementation of the results of the screen under the first Enter the tree node value of-1 as an input end, and then choose to carry out the operation, select the one show that the optimal tree, select the second is to insert a node, select the third is to find a node, select the fourth, delete a node. in the selection of the various operations will be prompted to after the screen or not to continue (Y/N), choice of Y is to continue to operate, select the N is out of operation. The software interface is simple, easy to operate, have adopted statements in Chinese, simple and easy to understand.
Date : 2026-01-01 Size : 2kb User : 梁静
[Other] tree DL : 0: 构造二叉树的抽象数据类型对于给定的先序序列和中序序列，构造二叉树，并按层输出所有结点内容，要求每层结点输出一行按层输出上述二叉树所表示的森林的所有结点内容-Binary tree structure of the abstract data type for a given sequence of the first sequence and in order sequence, structure tree, and all the output layer node content, require each node output layer output by his party expressed the above-mentioned tree all forest node content
Date : 2026-01-01 Size : 1kb User : zt
[Other] hy240a_assign2.tar DL : 0: This a binary search tree with void* pointer in data segment in order you to search store and delete O(n) worst case, O(log(n)) agerage case data.-This is a binary search tree with void* pointer in data segment in order you to search store and delete O(n) worst case, O(log(n)) agerage case data.
Date : 2026-01-01 Size : 19kb User : thesky
[Other] haskell DL : 0: 用haskell语言写的二叉树和排序的算法，学函数程序设计时写的-implement binary search tree and sort with haskell by myself
Date : 2026-01-01 Size : 1kb User : 王金贵
[Other] Caculateor DL : 0: 简单计算器的实现二叉表达式树加减乘除四则运算-The realization of a simple calculator binary expression tree addition and subtraction multiplication and division four operations
Date : 2026-01-01 Size : 296kb User : Yang
[Other] The-tree DL : 0: （1）输入字符序列，建立二叉链表。（2）中序遍历二叉树:递归算法。（3）中序遍历二叉树:非递归算法。（最好也能实现先序，后序非递归算法）（4）求二叉树的高度。（5）求二叉树的叶子个数。（6）建立中序线索二叉树，并实现中序遍历。（8）借助队列实现二叉树的层次遍历。（9）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) Enter the character sequence of binary list. (2) in traversing Binary: recursive algorithm. (3) in traversing Binary: non-recursive algorithm. (Best to achieve the first-order, post-order non-recursive algorithm) (4) Find the height of the binary tree. (5) Find the number of leaves of a binary tree. (6) to establish inorder threaded binary and achieve the in-order traversal. (8) by means of the queue level traversal of a binary tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.
Date : 2026-01-01 Size : 8kb User : BidyBai
[Other] Binary-sort-tree DL : 0: 这是数据结构中的二叉排序树的综合操作：插入、删除、查找和中序遍历。-This is a binary sort tree data structure operations: insert, delete, find and preorder.
Date : 2026-01-01 Size : 2kb User : Dick
[Other] binary-tree DL : 0: 创建二叉树，搜索二叉树，包括前向遍历和后向遍历。-Create a binary search tree, including forward and backward traversal traversal.
Date : 2026-01-01 Size : 2kb User : shimijun
[Other] tree DL : 0: (1) 由{4, 9, 0, 1, 8, 6, 3, 5, 2, 7}创建一棵二叉排序树bt并以括号表示法输出； (2) 判断bt是否为一棵二叉排序树； (3) 采用递归和非递归两种方法查找关键字为6的结点，并输出其查找路径； (4) 分别删除bt中的关键字为4和5的结点，并输出删除后的二叉排序树。 -(1) by {4, 9, 0, 1, 8, 6, 3, 5, 2, 7} to create a binary sort tree and bracket notation bt output (2) to determine whether a two bt Binary sort tree (3) the use of two methods of recursive and non-recursive lookup keyword node 6, and outputs its search path (4), respectively, to delete the keyword bt junction 4 and 5, and the output Binary sort tree after deletion.
Date : 2026-01-01 Size : 136kb User : Yoalnda
[Other] BinaryTree-and-BinaryMap DL : 0: 二叉树和基于二叉树实现的map，接口同std::map但有所简化，适合作为模板编程学习的参考资料-Binary and implemented based on binary tree map, interface with std :: map but somewhat simplified, suitable as a reference template programming learning
Date : 2026-01-01 Size : 4kb User : giveumyname
[Other] BINARY-SEARCH-TREE.cpp DL : 0: 二叉搜索树在动态查表中有特别的用处，一个无序序列可以通过构造一棵二叉搜索树变成一个有序序列，构造树的过程即为对无序序列进行排序的过程。每次插入的新的结点都是二叉搜索树上新的叶子结点，在进行插入操作时，不必移动其它结点，只需改动某个结点的指针，由空变为非空即可。这里，我们想探究二叉树的建立和序列输出。-Binary search tree has a dynamic look-up table in particular the usefulness of an unordered sequence can construct a binary search tree into an ordered sequence, the process of construction of the tree is the sort of process sequence disorder. Every time a new node is inserted into a binary search tree new leaf node, during the insertion operation, without moving the other nodes, just a pointer to a node changes, namely empty to non-empty can. Here, we want to explore the creation and output binary sequence.
Date : 2026-01-01 Size : 1kb User : nature

« 12 3 4 5 6 7 8 9 10 ... 16 »