Search - Binary Tree

Search - Binary Tree - List

[Other] 二叉树的类实现 DL : 0: 二叉树的一般操作: 1. 判断二叉树是否为空。 2. 搜索二叉树中的某一项。 3. 在二叉树中插入一项。 4. 从二叉树中删除一项。 5. 求二叉树的高度。 6. 求二叉树的节点数量。 7. 求二叉树的叶节点数量。 8. 遍历二叉树。 9. 复制二叉树。 -binary tree : 1. To judge whether the binary tree is empty. 2. Binary Tree Search of a one. 3. The insertion of a binary tree. 4. From a binary tree removed. 5. For binary tree height. 6. For binary tree node number. 7. For binary tree leaf node number. 8. Traverse binary tree. 9. Replication binary tree.
Date : 2025-12-19 Size : 107kb 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 : 2025-12-19 Size : 40kb User : 苏言暖
[Other] avl DL : 0: 数据结构的平衡二叉树的操作，包括插入和删除，查找-Balanced binary tree data structure of the operation, including insert and delete, search
Date : 2025-12-19 Size : 8kb User : lj
[Other] SimpleBinaryTreeExample DL : 0: 利用MFC库实现数据结构二叉树的一个简单例子，除算法外，包含一些基本的算法结果显示，有助于了解掌握二叉树-The use of MFC library binary tree data structure to achieve a simple example, with the exception of algorithms, the algorithm contains some basic results showed that help understand binary tree
Date : 2025-12-19 Size : 35kb User : GYK
[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 : 2025-12-19 Size : 3kb User : Alex
[Other] Binary-Tree-levorder DL : 0: 用C++实现二叉树中的层次遍历（Binary_tree.cpp中），levorder，用的是队列-Use C++ achieve the the hierarchical traversal (Binary_tree.cpp) binary tree, levorder, the queue
Date : 2025-12-19 Size : 354kb User : 王璐
[Other] The--operation--binary-tree DL : 0: 程序的主要功能 1 按照二叉链表存贮创建二叉树 2 二叉树的遍历——先序中序后序三种不同方式遍历 3 统计总结点与叶子节点的个数 4 树状打印二叉树注释清楚-The main functions of the program 1 according to the binary linked list storage create binary tree 2 binary tree traverse--first order after order sequence three different ways to traverse 3 statistical summary point and leaves the number of nodes 4 tree print binary tree Comments clearly
Date : 2025-12-19 Size : 250kb User : 话语
[Other] binary-tree DL : 0: 虽然代码有点负责，但此代码不同于经典二叉树后序编译，以枚举法对各种条件进行分析-Although the code is responsible for a bit, but this code is different from the classic binary tree postorder compiled enumeration method to analyze a variety of conditions
Date : 2025-12-19 Size : 1kb User : kw
[Other] Binary-tree DL : 0: 二叉树程序，内涵多个报错功能，不错的,欢迎下载-Binary tree program, the connotation multiple error function good.
Date : 2025-12-19 Size : 145kb User : 张良
[Other] Binary-tree-traversal DL : 0: 二叉树遍历，前序遍历中序遍历层次遍历非递归方法-Binary tree traversal
Date : 2025-12-19 Size : 221kb User : 王强
[Other] binary-tree DL : 0: 二叉树的简单应用，建立、遍历以及递归实现二叉树的应用-the binary tree
Date : 2025-12-19 Size : 5kb User : 韩静雅
[Other] Binary-Tree DL : 0: How to build a dictionary using Binary Tr-How to build a dictionary using Binary Tree
Date : 2025-12-19 Size : 242kb User : 试题
[Other] Binary-Tree-reversal DL : 0: 数据结构二叉树反转的C++代码，欢迎批评指正，相互学习-c++ for Binary Tree reversal
Date : 2025-12-19 Size : 1.02mb User : aby
[Other] binary-tree-postorder-traversal DL : 0: 二叉树非递归后序遍历,数据结构中常见的面试考题-Non-recursive binary tree postorder traversal
Date : 2025-12-19 Size : 1kb User : 付涛
[Other] traversal-of-binary-tree DL : 0: 软件基础实验中的二叉树遍历C代码，比较基础，希望可以通过-traversal of binary tree
Date : 2025-12-19 Size : 4kb User : ZHAOXUAN
[Other] Binary-tree-structure DL : 0: 从文件中接受一组数，动态创建一个二叉树，并且先序中序和后序遍历-Accept a set of numbers, from a file dynamically create a binary tree, and the first sequence in the sequence and after preorder
Date : 2025-12-19 Size : 1kb User : 顾为玉
[Other] binary-tree-collision-code DL : 0: 射频识别技术里的二进制树碰撞代码，防碰撞能力-Radio frequency identification technology in the binary tree collision code, anti-collision
Date : 2025-12-19 Size : 794kb User : 欧阳扬
[Other] Balanced-binary-tree-operation-two DL : 0: 该程序主要是针对平衡二叉树的操作而设计的，程序执行的命令包括：（1）构造平衡二叉树；（2）输入数据；（3）对平衡二叉树的查找、插入、删除操作；（4）结束 -The program is mainly aimed balanced binary tree operation and design, program execution commands include: (a) construct a balanced binary tree (2) the input data (3) on the balanced binary tree search, insert, delete operations (4) the end of the
Date : 2025-12-19 Size : 2kb User : 张妍
[Other] binary-tree DL : 0: 二叉树的建立以和先序、中序、后序遍历以及层次遍历，还可以查找并删除节点等-the basic function of binary tree
Date : 2025-12-19 Size : 2kb User : 杨涛
[Other] Experimental-binary-tree-traversal DL : 0: 二叉树的创建及遍历实验要求：数据元素类型ElemType取float。 1）从键盘按照前序遍历的顺序依次输入二叉树的各元素，创建此二叉树。 2）对该二叉树进行层次遍历，并输出遍历后的序列。(参照图的广度优先搜索)-Binary tree traversal create and test requirements: data element types ElemType take float. 1) from the keyboard in accordance with the pre-order traversal order of the elements of the input binary tree, create this binary tree. 2) level of the binary tree traversal, and after traversing the output sequence. (See graph breadth-first search)
Date : 2025-12-19 Size : 90kb User : selena

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