搜索资源列表
BinaryTree
- 数据结构二叉树,及其遍历,镜像,输出等相关操作C++源码。-Binary tree data structure and its traversal, mirror, output the operation C++ source.
C4_5.m
- his algorithm was proposed by Quinlan (1993). The C4.5 algorithm generates a classification-decision tree for the given data-set by recursive partitioning of data. The decision is grown using Depth-first strategy. The algorithm considers all the poss
二叉树的基本操作
- 二叉树的基本操作(1)在二叉链表上设计和实现下列二叉树运算的算法 ① 设计递归算法,实现:删除二叉树,求二叉树的高度,求二叉树中叶子结点数,复制二叉树,交换二叉树的左右子树。 ② 设计算法,按自上到下,自左向右的次序,即按层次遍历一棵二叉树。 ③ 设计main函数,测试上述每个运算。 -Binary Tree s basic operations (1) in the binary list on the design and realization of the fol
InThrBiTree
- 数据结构中线索二叉树的创建、遍历及建线索等-Threaded binary tree data structure creation, traversal and construction leads, etc.
BinarySearchTree
- 二叉搜索树的各种基本操作,各种遍历的递归和非递归实现,还有输出在指定范围的节点等-Binary search tree, variety of basic operations, a variety of traversal recursive and non-recursive implementation, as well as output in the specified range of nodes, etc.
data_structure
- 数据结构中最经常用到的,包括链表、双链表、二叉树、平衡二叉树、哈希表等-Data structure the most frequently used, including the list, double linked lists, binary tree, balanced binary tree, hash table, etc.
Element
- 标记语言的简单解释器算法实现,实现一些简单的二叉树-A simple markup language interpreter algorithm, to achieve some simple binary tree
1
- 遍历问题 (时间限制为:1000毫秒) 描述: 已知二叉树的中序和先序遍历可以唯一确定后序遍历、已知中序和后序遍历可以唯一确定先序遍历,但已知先序和后序,却不一定能唯一确定中序遍历。现要求根据输入的中序遍历结果及某一种遍历,要求输出另一种遍历。 输入: 输入包括若干个测试用例,第一行为一个自然数n,表示用例个数,接下来4n行,即每个用例占4行,其中第一行表示第一种遍历方式,第二行为第一种遍历结果,第三行为第二种遍历方式,第4行为第二种遍历结果。注明:先序遍历方式
Expreesion
- 一个表达式和一棵二叉树之间,存在着自然的对应关系。写一个程序,实现基于二叉树表示的算术表达式Expression的操作。 【基本要求】 【一】【必做部分】 假设算术表达式Expression内可以含有变量(a-z),常量(0-9)和二元运算符(+,-,*,/,^(乘幂))。实现以下操作: (1)ReadExpr(E)――以字符序列的形式输入语法正确的前缀表达式并构造表达式E。 (2)WriteExpr(E)――用带括号的中缀表达式输出表达式E。 (3)Assign(V,c
Hashbasedrouting
- 这是基于哈希函数的路由表的算法,对路由表的熟悉有很大的帮助。希望大家-Hash-based routing table and binary tree search algorithm
dsassdasdasda
- 二叉树建立与遍历源代码,这是我大二时做的实验报告,现在毕业了删了可惜就上传了,通过自己调试编译无误。-Binary Tree Traversal establish the source code, this is my sophomore year when the report of the experiment, and now have decided to graduate a pity on the upload, and through their own correct comp
erchashujisuanqi
- 数据结构的二叉树遍历,多功能计算器,是学习二叉树的经典案例-Binary tree traversal of the data structure, multi-function calculator, is a classic case of learning binary tree
datastructure
- 数据结构二叉树实验报告,包括 (1)创建二叉树 (2)递归算法先序遍历二叉树 (3)非递归算法中序遍历二叉树 (4)递归算法后序遍历二叉树 (5)求二叉树叶子结点个数 (6)按层次遍历二叉树 (7)求二叉树树深 -A binary tree data structure, experimental report, including (1) Create a binary tree (2) recursive algorithm for preorder trav
BinaryTree
- 用MFC实现的二叉树的建立、查找、删除、插入-MFC achieved with the establishment of a binary tree, find, delete, insert
huffman
- 根据对二叉树知识的理解,实现对最优二叉树哈夫曼树的构造,遍历,然后实现编码,译码的功能,结果保存到文件中. 输入要进行编码的字符段,统计对字符的出现次数即为权值,根据权值建立哈夫曼树,由哈夫曼树可得到各字符的编码,反过来可得数字译码,保存到文件中 -Based on a binary tree of knowledge of understanding, to achieve the optimal Huffman tree binary tree structure, traverse
shujujiegoujiapu
- 这是本人大二的时候数据结构课程设计所做的一个家族树管理系统,基于二叉树,实现家族的家谱管理。-This is my second year data structures course, when doing a family tree design management system, based on the binary tree, the genealogy of the family managed to achieve.
遍历二叉树的3个递归算法
- 此程序给出了遍历二叉树的三个递归算法,并且利用了先序扩展序列建立二叉树,对于数据结构学习者有很大帮助-this procedure is a traversal of a binary tree three recursive algorithm, and use the first sequence extended sequence to establish a binary tree, the data structure for a great help learners
ThreeOrder
- 利用二叉树的逻辑结构、链式存储结构等,实现二叉树的前序、中序和后序遍历算法 -The logic of the use of binary tree structure, the structure of chain stores and so on, to achieve the first order binary tree, in order and post-order traversal algorithm
structure
- 数据结构二叉树实现代码:功能如下: (1)创建二叉树 (2)递归算法先序遍历二叉树 (3)非递归算法中序遍历二叉树 (4)递归算法后序遍历二叉树 (5)求二叉树叶子结点个数 (6)按层次遍历二叉树 (7)求二叉树树深 -A binary tree data structure to achieve the code: Function is as follows: (1) Create a binary tree (2) recursive alg
3
- 将表达式存入二叉树中,并输出,先序、中序、后序遍历输出-The expression in binary tree, and output, first order, in the preface, traverse sequence after the output