搜索资源列表
MyTree
- 在控制台实现了二叉树的树状打印， 方便形象-Print in the console of a binary tree tree
4
- 1．输入字符序列，建立二叉链表。 2．中序遍历二叉树:递归算法。 3．中序遍历二叉树:非递归算法。 4．求二叉树的高度。 5．求二叉树的叶子个数。 6．试编写交换以二叉链表作存储结构的二叉树中所有结点的左、右子树的算法。 7．建立中序线索二叉树，并实现中序遍历。 -1. Input sequence of characters, the establishment of binary list. 2. Inorder traversal binary tree:
csharpcorecontent
- 这个主要写了CSHARP在数据结构中的一些操作，比如堆栈，二叉树-CSharp wrote the main data structure in some operations, such as stack, binary tree
datastructure
- 数据结构关于二叉树的课件，有些是书上没有的，自己补充的-On the binary tree data structure of the courseware, books and some are not, add their own
datastructure
- 非递归创建二叉树.并且用非递归算法实现对二叉树的前序、中序、后序和广度遍历。 实现语言:C-Create a binary tree non-recursive. And the use of non-recursive algorithm for binary tree of the former order, in sequence, after the traversal sequence and breadth. Implementation language: C
er
- 通过编写函数实现特殊二叉树的操作，是特殊二叉树的插入、删除比一般的二叉树效率更高-Function through the preparation of a special binary tree operation, is a special binary tree insertion, deletion of the tree than the average efficiency
BiTree
- 二叉树头文件 用以实现二叉树-Header files for the realization of binary tree binary tree
tree
- 二叉树运用，简单背包问题，是本人初学数据结构的作业，-Bintree use, simple knapsack problem, is my data structure beginner operations,
erchashu
- 二叉树的C++代码 用处很多的哦 尤其对那些正在学数据结构的同学而言-Binary Tree C++ Code Oh, a lot of useful especially for those who are school students in terms of data structure
hafuman
- 哈弗曼编解码 编写函数，实现建立哈夫曼树和生成哈夫曼编码的功能。 编写函数，实现二叉树的输出和释放功能。 编写主函数，从终端输入一段英文文本；统计各个字符出现的频率，然后构建哈夫曼树并求出对应的哈夫曼编码；显示哈夫曼树和哈夫曼编码；最后释放哈夫曼树。 选做内容：修改程序，选择实现以下功能： 编码：用哈夫曼编码对一段英文文本进行压缩编码，显示编码后的文本编码序列； 统计：计算并显示文本的压缩比例； 解码：将采用哈夫曼编码压缩的文本还原为英文文本。-err
printBiTree
- 打印二叉树，数据结构学习者专用-Print binary tree, data structure dedicated learner
huffman
- 哈夫曼编码的实现与解析 基于二叉树技术的搜索 遍历-Huffman coding with the analytical technique based on the binary tree search traversal
erchashu
- 用c语言实现的关于二叉树的各种操作，适合初学数据结构的人-C language used on the binary tree to achieve a variety of operations, data structures suitable for beginners who
binanytree-postorder
- 实现数据结构中的二叉树的后续遍历,能够从你输入的二叉树中找到路径-Data structure of the follow-up traversal of the tree, you have entered from the binary tree to find the path
erchashu1
- 建造二叉树、二叉树的前序、中序、后序、层序遍历-The construction of binary tree, binary tree of the former order, in sequence, after the sequence, sequence traversal
INprinttree
- 凹入表的形式打印树 一先序遍历输入，把树转化成二叉树-Indentations in the form of a first print tree traversal input, the trees into tree
bitree
- 二叉树的四种形式的遍历，分别是先序，中序 后序，层遍历-Binary tree traversal of the four forms, namely the first order, in sequence after sequence, layer traversal
Alex
- 大二数据结构实验课的几个源码（顺序表的合并、多项式的合并、栈和队列的基本操作、稀疏矩阵的运算、二叉树基本操作、图的存储和应用）-Experimental data structure sophomore class several source (the order form merger, the merger of polynomial, stack and the basic operation of the queue, sparse matrix computation, the ba
erchashu
- 有关二叉树的各种操作，可以运行。没有人祸问题。程序包括二叉树的各种遍历方法，和建立等待-A variety of tree-related operations, can run. No man-made problems. This process includes a variety of binary tree traversal methods, and the establishment of waiting
BuildTree
- 建立二叉树的程序，内有代码。希望会对大家有用，对于初级使用者有帮助-Procedures for the establishment of tree with a code. Hope will be useful for primary users to help