Search - Binary Tree

Search - Binary Tree - List

[ELanguage] 电话本管理系统 DL : 0: 该系统是本人课程设计作业，因为时间关系，只用了两天多的时间编成。所以有很多地方没有得到增强。版本为1.0。现作以下升级。增加NEW，OPEN版本。提高输入容错。判断输入的对错。时间关系，搜索功能为线性搜索，现增强如下：f_search:费氏查找法；btree:二叉树查找法；l_search：线性查找法； r_search：递归折半查找法；zcsear:杂凑碰撞查找法；o_sear:插补查找加强法；排序是冒泡法，现增强为：heaps:累堆排序；binary：二叉树排序；xieer：谢耳排序；sinsert：插入排序；quicks:快速排序；select:选择排序法；有时间不仿试试。-f_search: Find Act Fernandez btree: binary tree search method l_search: linear search method r_search: Recursive half Find Law zcsear: Find a hash collision law o_sear: interpolation search Enhancement Act sort is bubbling method are enhanced for: heaps: HEAPSORT tired binary: binary tree sort xieer: Xie ears sort sinsert: Insertion Sort quicks: quick sort select: Select Sort Method
Date : 2025-12-19 Size : 5kb User : 游鸿明
[ELanguage] hfm DL : 0: 【数据结构】二叉树遍历及赫夫曼编码表完整版-[] Binary tree data structure traversal and Huffman coding table full version
Date : 2025-12-19 Size : 9kb User : 箱子
[ELanguage] binstree DL : 0: To learn the representation and implementation of a binary search tree.
Date : 2025-12-19 Size : 3kb User : Wally
[ELanguage] Binary_search DL : 0: Binary search example. Let you search binary tree. It is simple example for beginners. It will help to learn using binary tree for search in simple steps.
Date : 2025-12-19 Size : 1kb User : shahid
[ELanguage] BTree DL : 0: this code implements a binary tree using c/c++.
Date : 2025-12-19 Size : 151kb User : marvin
[ELanguage] Element DL : 0: 标记语言的简单解释器算法实现，实现一些简单的二叉树-A simple markup language interpreter algorithm, to achieve some simple binary tree
Date : 2025-12-19 Size : 14kb User : 周佳栋
[ELanguage] BinarySearchTree DL : 0: 二叉查找树，可基于二叉查找树的功能查找英文单词的个数-Binary search tree, based on the function of the binary search tree to find the number of English words
Date : 2025-12-19 Size : 15kb User : Nan
[ELanguage] findpath DL : 0: find path c++ binary tree find and output
Date : 2025-12-19 Size : 1kb User : KSTAIN wwy
[ELanguage] Two-fork-tree-operation DL : 0: 　　熟练掌握二叉树的各种遍历算法，并能灵活运用遍历算法实现二叉树的其它操作；-Proficiency in a variety of binary tree traversal algorithm, and other operations of the binary tree traversal algorithms to achieve flexibility in the use of
Date : 2025-12-19 Size : 16kb User : 李雨
[ELanguage] binary-tree-in-templates DL : 0: so i want to make a code, that creates a binary tree, that holds data, for example ints like 1,6,2,10,8 and on pop i get the biggest number, and after that it gets deleted from the tree, and on push i can insert a new element. And this should be in a template so i can easy change the data type i want to hold in the tree. Now i got the tree so far, without template it is working fine thought, i can add items, and i can print them, but when i try to put it in a template, i get the following error: use of class template requires template argument list . What could be the problem? Maybe i am doing it totally wrong. Any suggestions are welcome.
Date : 2025-12-19 Size : 1kb User : Dhilip
[ELanguage] Tree DL : 0: 有关数据结构中树的一些C代码，如何建立二叉树，如何进行霍夫曼编码。-Some C code about data structure tree, how to create a binary tree, how to Huffman coding.
Date : 2025-12-19 Size : 637kb User : 郭强
[ELanguage] bintree DL : 0: 关于二叉树的插入，先序遍历，后序遍历，中序遍历，叶子节点个数，树的深度，路径查找。-Binary tree insertion, preorder, postorder traversal, preorder, the number of leaf nodes, the depth of the tree, the path to find.
Date : 2025-12-19 Size : 2kb User : 刘博
[ELanguage] CP_work_8 DL : 0: 设计一个四则表达式分析软件，其接受从文件或键盘输入的四则表达式（运算对象支持整数和变量），给出该表达式的二叉树表达形式，并在键盘上按后续遍历方式输出该二叉树。例如，输入a+b*c，输出 a b c * + 提示：参考下列的设计指导: 递归下降分析法实验设计思想及算法为G的每个非终结符号U构造一个递归过程，不妨命名为U。U的产生式的右边指出这个过程的代码结构： (1)若是终结符号，则和向前看符号对照，若匹配则向前进一个符号；否则出错。 (2)若是非终结符号，则调用与此非终结符对应的过程。当A的右部有多个产生式时,可用选择结构实现。-Design a four-expression analysis software, which accepts four expressions from a file or keyboard input (support integer operands and variables), given expression in the form of a binary tree of the expression, and on the keyboard, press the subsequent traversal of the binary output. For example, enter a+ b* c, output a b c*+ Note: Refer to the following design guidelines: Recursive descent experimental design ideas and algorithm analysis To construct each nonterminal U G a recursive process, it may be named as U. U generates right-hand side indicates the code structure of the process: (1) If the end of the symbol, and lookaheads contrast, if the match is to advance a symbol otherwise error. (2) If the non-terminal symbol, then call this nonterminal corresponding process. When there are multiple right part A of production, s
Date : 2025-12-19 Size : 149kb User : jchen
[ELanguage] BinaryTree DL : 0: 基于二叉树实现一元多项式的加法、减法、乘法、除法，并实现算法的优化及对内存的最小使用，将结果存储在原多项式中-Based on a binary tree polynomial addition, subtraction, multiplication, division, and to achieve the optimization algorithm and minimal use of memory, and stores the result in the original polynomial
Date : 2025-12-19 Size : 7.37mb User :
[ELanguage] Binary-Tree DL : 0: 数据库结构中实验内容Binary Tree实验源代码，代码比较短-Database structure experiments Binary Tree experiment source code, the code is relatively short
Date : 2025-12-19 Size : 2kb User : 陈凤群
[ELanguage] binary DL : 0: Binary search tree source code
Date : 2025-12-19 Size : 2kb User : Ainu