搜索资源列表
tinyxml
- TinyXML是一个开源的解析XML的解析库，能够用于C++，能够在Windows或Linux中编译。这个解析库的模型通过解析XML文件，然后在内存中生成DOM模型，从而让我们很方便的遍历这棵XML树。-TinyXML is a simple, small, minimal, C++ XML parser that can be easily integrating into other programs.
data-structure-experiment
- 数据结构实验：用C++实现二叉树的结点总数、叶子结点个数和深度，能够很好地掌握二叉树及对二叉树进行遍历。-Experimental data structure: it uses C++ to achieve the total number of nodes of the binary tree, the leaf node number and depth, you can master the binary tree and binary tree traversal.
bitree_cpp
- 主要是树的各种操作，包括各种顺序的遍历，递归不递归建树，寻找双亲，或是寻找叶子-Tree variety of operations, including a variety of order traversal, recursive recursive achievements, looking for their parents, or to find leaves
Huffman-
- 用c语言编写的创建哈弗曼树的代码，代码涉及到创建哈弗曼树，遍历哈弗曼树-C language code to create the Huffman tree, the code involves creating the Huffman tree, traverse the Huffman tree
实现一个用儿子兄弟法储存的树
- 本次程序设计是为了实现一个用儿子兄弟法储存的树，并检测它的前序遍历、后序遍历和层次遍历的小程序。-The program is designed to achieve a method of storage with son brother tree, and detect its former preorder, postorder and level traversal applet.
shuheerchashu
- 以下问题要求统一在一个大程序里解决。 按先序遍历的扩展序列建立二叉树的存储结构 二叉树先序、中序、后序遍历的递归算法 二叉树中序遍历的非递归算法 二叉树层次遍历的非递归算法 求二叉树的深度(后序遍历) 建立树的存储结构 求树的深度-The following questions require a unified solution in a large program. Extension of the first-traversal sequence to esta
Btree
- 二叉树的基本操作：建立二叉树、遍历二叉树、求树深度、输出二叉树等-Binary Tree basic operations: build binary tree, binary tree traversal, seeking tree depth, the output binary tree
shiyanbaog
- 树的查找程序，对树进行遍历，查找到响应的数据-Tree Finder, traverse the tree, find the response data
binarytree
- 二叉树以lson-rson链接方式存储，以菜单方式设计并完成功能任务：建立并存储树、输出前序遍历结果、输出中序遍历结果、输出后序遍历结果、交换左右子树、统计高度，其中对于中序、后序的遍历运算要求采用非递归方式。-Binary links to lson-rson stored to design the menu and complete functional tasks: Create and store the tree, the output results before preorder
erchashu
- 该代码文件实现了二叉树的一些基本操作，包括节点的遍历、增加删除等-The code files to achieve some basic binary operations, including traversing nodes increases delete
DSA_DFS_BFS
- 深度优先搜寻与宽度优先搜寻算法的实现，在二叉树中最有效的遍历算法-Depth-first search and breadth-first search algorithm, in the most efficient binary tree traversal algorithm
search-tree
- 建立二叉树，层序、先序遍历 要求能够输入树的各个结点，并能够输出用不同方法遍历的遍历序列；分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数；-Establishment of a binary tree, sequence, preorder required to enter each node of the tree, and can output traversal sequences of different methods to traverse
QQVC60201501230118
- 遍历树控件和SQL数据库搭配使用的代码，适合初学者了解数据库的访问，树控件的遍历添加等操作!-Traversing the tree control and SQL with a code to use, suitable for beginners to learn to access the , the tree traversal controls add other operations!
8
- 家谱管理系统。基本是多叉树孩子表存储法的遍历、删除、查找、更新等基本算法。-Genealogy management system. Substantially more tree traversal child table storage method, delete, search, update the basic algorithm.
datastructure
- 数据结构中树及图的遍历实现，加深对此内容的理解与掌握-Data structure of the tree and the traversal to achieve, to deepen the understanding and mastery of this content
BinaryTree
- 输入一个二叉树，进行前序、中序、后序的遍历，同时计算树的深度，查找所要查找的结点的层数。-build a binary tree, to do the traverse in different ways and calculate the depth of the tree.
tunnnun
- 利用二叉树层次遍历求二叉树的宽度（二叉树的宽度即二叉树同层结点数的最大值）(The use of two tree level traversal to find the width of the two tree (two tree width, that is, the two fork tree with the maximum number of nodes))
Decision_making_tree
- 机器学习课本中的未剪枝决策树代码实现，可以直接运行，自行根据书中（西瓜书）表进行建表，输出结果为层次遍历。(Machine learning textbooks do not prune decision tree code, you can run directly, according to the book (watermelon book) table built table, the output results for the hierarchical traversal.)
Desktop
- 数据结构 java版本 二叉树的创建 序遍历，中序遍历，后序遍历 +考试题目(Ordered traversal, inorder traversal, backward traversal)
1111
- 二哥学了二叉树的顺序存储后，被下面一个问题难住了，于是他请你帮他解决。给你一个前序遍历和中序遍历，问顺序存储的数组是什么样子的。 Example Input Format 第一行为前序遍历，第二行为中序遍历，节点个数不超过26. Output Format 输出一行，表示顺序存储的数组，以空格隔开，NULL表示空节点，数组空间不超过1000个节点(The second order storage learned two tree, asked the next questi