搜索资源列表
普利姆最小生成树
- 用普利姆算法实现最小生成树，简单的排序算法。对学习很有帮助-with minimum spanning tree algorithm, a simple algorithm. The study helpful
非递归遍历一
- 本文用Ｃ语言实现了双链表结构树的前中后序非递归遍历-Using C language of the Double Chain structure tree before, during and after non - recursive traversal sequence
线索树
- 本文用Ｃ语言实现了有关线索二叉树的一系列算法-Using C language of the clues to a series of binary tree algorithm
tree
- 最小生成树 算法 利用二叉树原理生成最小生成书 数据结构实验-Principle of minimum spanning tree algorithm uses a binary tree data structure generated experimental Smallest Book
SuffixTree
- 重要算法后缀树的实现，非常实用-Important algorithm for the realization of the suffix tree
tree
- binnary tree which uses pointers
tree
- 多叉树的操作代码。控制台程序。内有操作说明。-The multi-tree operation code. Console application. There are instructions.
Preorder-binary-tree-(tree-print
- 先序二叉树(树状打印） 将二叉树以先序输出，并且图状打印-Preorder binary tree (tree print) binary tree output and print maps for preorder
Tree-traversal
- MFC实现树的建立，可自动得到输入树的深度，先序、中序、后序遍历的结果，并用图形显示该树。-MFC to achieve the establishment of the tree can be automatically input the depth of the tree, preorder, inorder, postorder traversal, and graphical display of the tree.
binary-sort-tree
- 二叉排序树功能包括：插入，查找，遍历，删除，还有显示；（显示是需要树状的二叉排序树）-binary sort tree
binary-tree
- （1）输入字符序列，建立二叉链表。 （2）先序、中序、后序遍历二叉树:递归算法。 （3）中序遍历二叉树:非递归算法。（最好也能实现先序、后序非递归算法） （4）求二叉树的高度 。 （5）求二叉树的叶子个数。 （6）借助队列实现二叉树的层次遍历。 （7）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) Enter the character sequence to build binary list. (2) first order, in sequence, a
tree
- 算法与数据结构中的二叉树，孩子-兄弟存储的树，二叉线索树，最优二叉树，哈夫曼树等）。-Algorithm and data structure tree, children- brothers storage tree, binary tree trail, optimal binary tree, Huffman trees, etc.).
Tree-traversal
- 树的先序遍历、中序遍历、后序遍历，简单实现。-Tree preorder, preorder, postorder, simple implementation.
tree-suanfang
- 一个C语言实现的很简单树创建代码，对树创建时的递归不理解的，这里有中、后、前序的递归- a C language implementation is very simple to create a code tree, when the tree is created for recursive do not understand, here, and after the pre-order recursive
tree
- 控制台版学生管理系统，数据结构用平衡二叉树实现，10万数据秒杀，支持文件读写-The console version of the student management system, with a balanced binary tree data structure, data 100000 seconds to kill, the supporting documents to read and write
tree
- 输入字符序列，建立二叉链表。 前序、中序、后序遍历二叉树：递归算法。 前序、中序、后序遍历二叉树：非递归算法。 求二叉树的高度 。-Enter the character sequence, build binary list. Preorder, inorder, preorder after binary: recursive algorithm. Preorder, inorder, preorder after binary: non-recursive algor
Huffman-Tree
- 使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。 具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 -Emergence of the frequency of each character in the trigeminal lists using the Hu
Story-editor-binary-tree-traversal
- “文章编辑二叉树遍历各种排序.cpp”、“二叉树的建立以及遍历.cpp”、“各种排序.cpp”、“文章编辑.cpp”- The article edit binary tree traversal various sorting .c++ , build a binary tree traversal and .cpp , various sorting .cpp , Story Editor .cpp
2-3-tree-master
- 2—3树的建立，插入，删除，清空等功能的实现-Establish a 2-3 tree, insert, delete
kd-tree.cpp
- 三维点云配准kd-tree搜索算法，用于特征点的搜索匹配-3 d point cloud registration kd- tree search algorithm, is used to search of feature point matching