Search - Binary Tree

Search - Binary Tree - List

[Data structs] 树的问题（生成） DL : 0: ADT BinaryTree 的实现及验证程序采用的主要数据结构：二叉树、栈、队算法思想：1、先序建树、输出树、后序遍历用递归方法。性能分析：O( n )2、先序遍历、中序遍历：性能分析：O( n )(1) 若遇到新节点非空则先入栈，然后访问其左子树。(2) 若为空则将栈顶结点出栈，访问其右子树。(3) 循环1、2直到栈为空且无节点可入栈。先序与中序的区别是：先序在入栈时访问节点，中序在出栈时访问节点。3、层遍历：性能分析：O( n )(1) 根节点入队(2) 节点出队并访问(3) 若节点有左孩子，则左孩子入队；有右孩子，则右孩子入队。(4) 重复2、3直到队列为空。4、线索树：算法与先序遍历、中序遍历一样，只是将访问节点的Visit函数改为连接前驱与后继的操作。性能分析：O( -BinaryTree ADT Implementation and certification procedures used in the main data structure : binary tree, stack, algorithms team thinking : a first order contribution, the output tree, after preorder using recursive method. Performance Analysis : O (n) 2, preorder, the preorder : Performance Analysis : O (n) (1) If there is a new non-empty nodes were first pushed and then left to visit their son tree. (2) if the empty Zhanding node will stack up, visit their right subtrees. (3) 1,2 cycle until the stack is empty with no node can be pushed. First sequence with the sequence difference : Push the first sequence to visit nodes, which stack up in order to visit nodes. 3, the layer traverse : Performance Analysis : O (n) (1) nodes into Force (2) nodes and the team's visit (3) if the nodes ar
Date : 2025-12-19 Size : 2kb User : 徐欣
[Data structs] avl DL : 0: Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。-Addison-Velski and Landis (AVL- Tree s) of the binary tree, the right time for a few of the standard operation, such as insert, delete and search.
Date : 2025-12-19 Size : 947kb User : 倪玲
[Data structs] serach DL : 0: 二叉排序树的查找算法，用非递归做的，查找删除节点等操作-Binary Tree Search ranking algorithm, the use of non- recursive so that you delete nodes, etc
Date : 2025-12-19 Size : 160kb User : 苗建新
[Data structs] tree-leave DL : 0: 中序遍历输出二叉树输出二叉树的叶子树输出二叉树的节点数-which preorder output binary tree output binary tree leaf tree output binary tree nodes
Date : 2025-12-19 Size : 274kb User : 刘黎
[Data structs] manytrees DL : 0: 常用树数据结构集合，包括二叉树、二叉查找树、AA树、红黑树、伸展树的一整套实现，自带包装器、异常处理类，方便使用-common pool tree data structure, including the binary tree, binary search tree, AA tree, a red, black tree extend to achieve a set of trees, bringing their wrapper, abnormal class, user-friendly
Date : 2025-12-19 Size : 13kb User : esonic
[Data structs] bintree DL : 0: 二叉树的建立,遍历(两种方法),以及用txt文件存储二叉树的方式,还包括队列堆栈的操作-Tree establishment, ergodicity (two methods), as well as txt file storage by way of binary tree, but also the operation of queue stack
Date : 2025-12-19 Size : 6kb User : 王家
[Data structs] huff DL : 0: 利用数据结构的二叉树概念编写的MATLAB程序实现HUFFMAN编码。-Binary tree data structure using the concept of the preparation of the MATLAB program Huffman coding.
Date : 2025-12-19 Size : 1kb User : 沈少云
[Data structs] tree DL : 0: 用二叉树实现重言式真假的判别问题,对于矛盾式可以进行自己输入值判断-With binary tree to achieve true tautology Discriminant problems contradiction can enter their own value judgments
Date : 2025-12-19 Size : 2kb User : 李天宇
[Data structs] BSTree DL : 0: 程序包括了平衡二叉树的查找,插入,删除,合并等操作-Procedures, including the balanced binary tree search, insert, delete, merge, such as operation
Date : 2025-12-19 Size : 3kb User : 李
[Data structs] tree DL : 0: 完成二叉树的初始化、遍历以及相应的操作-Complete binary tree initialization, ergodicity and the corresponding operation
Date : 2025-12-19 Size : 1kb User :
[Data structs] tree DL : 1: 表达式类型的实现: 1、一个表达式和一颗二叉树之间，存在着自然的对应关系。 2、假设算术表达式Expression内可以含有变量（a～z）、常量（0～9）和二元运算符（＋，－，*，/，^）。实现一下操作。（1） ReadExpr(E)——以字符序列的形式输入语法正确的前缀表示式并构造表达式E。（2） WritrExpr(E)——用带括弧的中缀表示式输出表达式E。（3） Assign(V,c)——实现对变量V的赋值(V=c),变量的初值为0。（4） Value(E)——对算术表达式E求值。（5） CompoundExpr(P,E1,E2)——构造一个新的复合表达式（E1）P (E2)。 -Realize the type of expression: one, an expression, and between a binary tree, there is a natural correspondence between. 2, assuming that the arithmetic expression Expression can contain variables (a ~ z), constant (0 ~ 9) and binary operators ( ,-,*,/,^)。 You realize the operation. (1) ReadExpr (E)- sequence of characters in the form of input grammar correct prefix expressions and tectonic expression of E. (2) WritrExpr (E)- used within parentheses express output infix expression E. (3) Assign (V, c)- realize the value V of the variables (V = c), variable initial value is 0. (4) Value (E)- on the arithmetic expression E is evaluated. (5) CompoundExpr (P, E1, E2)- Construction of a new composite expression (E1) P (E2).
Date : 2025-12-19 Size : 57kb User :
[Data structs] btree DL : 0: 平衡二叉树操作的演示: 1、操作界面给出查找、插入、删除、退出等操作选择。 2、每种操作均要提示输入关键字。 3、每次插入或删除一个节点后，应更新平衡二叉树的显示（以凹入表形式显示）。 -Balanced binary tree operations Demo: 1, Operator Interface given to find, insert, delete, withdraw from the operation of choice and so on. 2, each operation must be prompted to enter a keyword. 3, each insert or delete a node, it should update the display of a balanced binary tree (in the form of indentation shown).
Date : 2025-12-19 Size : 240kb User :
[Data structs] tree DL : 0: 该程序的功能为已知二叉树中序遍历和后序遍历序列，求二叉树的二叉链表结构，程序中假设前序序列和中序序列已经分别储存在数组Pre和In中，由子树的前序和中序序列建立其二叉链表，在中序序列中查找子树根，计算左右子树的大小，置队列为空队列，输出左右孩子并入队列中-The functions of the program in order for the known binary tree traversal and postorder traversal sequence, and the binary tree structure list, the program assumes the former order sequence and sequences in the sequence has been stored in the array, respectively, Pre and In by sub-tree in the sequence before the sequence and the sequence of the establishment of second fork list, in order to find sub-sequences Shugen calculated about the size of subtree, home Queue queue is empty, the output about the children into the queue
Date : 2025-12-19 Size : 1kb User : ruikobe
[Data structs] binary_tree DL : 0: 创建一个二叉树及进行二叉树的遍历、计算、复制等相关基本操作-Create a binary tree and binary tree traversal, computing, copying and other related basic operation
Date : 2025-12-19 Size : 4kb User : szl
[Data structs] OPT DL : 0: 从输入文件中读取数据,构造最优二叉树,输入文件格式如下: 节点的值出现概率例如: A 0.001 B 0.25-Read from the input file data, the optimal binary tree structure, input file format is as follows: node probability value such as: A 0.001B 0.25
Date : 2025-12-19 Size : 905kb User : 魏木木
[Data structs] binary-tree DL : 0: c语言描述的数据结构，二叉树的数据结构的抽象数据类型-c language to describe the data structure, binary tree data structure of the abstract data types
Date : 2025-12-19 Size : 2kb User : 猫
[Data structs] binary-tree DL : 0: 这是个有关C语言二叉排序树的简单小小小小程序 -This is a small c language program about binary tree
Date : 2025-12-19 Size : 1kb User : heihei
[Data structs] Binary-tree-traversal-of-recursion DL : 0: 【二叉树遍历的递归算法实现】操作：根据提示输入相应数据实现各种功能函数：菜单函数(menu) 前序建立二叉树(Crt_BinTree) 访问结点(Visit) 前序遍历(Pretraverse) 中序遍历(Intraverse) 后序遍历(Suctraverse) 删除树(Destory) 操作函数(perform)Pretraverse 主函数(main) 说明：结点数据初始为char型，但可在前面代码部分修改成其他类型，输入时@代表子树为空-The binary tree traversal of recursion algorithm 】 Operation: according to the prompt corresponding input data realization of different functions Function: the menu function (menu) The preface to establish a binary tree (Crt_BinTree) Access nodes (Visit) The preface to traverse (Pretraverse) In order to traverse (Intraverse) After traverse sequence (Suctraverse) Delete tree (Destory) Operation function (perform) Pretraverse The main () function (main) Note: data for type char initial nodes, but can be in front the code changes Into other types, input on behalf of children for empty @ tree
Date : 2025-12-19 Size : 2kb User :
[Data structs] Balanced Binary Tree DL : 0: 平衡二叉树源代码二叉树的格式化输出可执行文件(Balanced two fork tree source code Two tree formatted output)
Date : 2025-12-19 Size : 117kb User : 乌鸦坐飞机
[Data structs] Tree DL : 0: Binary Tree / Can insert word or number
Date : 2025-12-19 Size : 1.08mb User : YYSSHH

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