搜索资源列表
kechengsheji
- 二叉树的遍历,源代码,JAVA课程设计的源代码
erchashu
- 1、 利用先序遍历和层次遍历的结果建立二叉树 2、 实现二叉树的层次遍历 3、 统计二叉树叶子结点的个数（递归）。 4、 将二叉树左右子树相互交换（递归） 5、 判断二叉树是不是二叉排序树。 6、 完成二叉排序树的插入、删除和平衡操作。 -1, the use of first order to traverse and level traversal of the results established binary tree 2 and realize the b
slicingtree
- 用java实现的切割二叉树，使二叉树的子节点可以分割成新的子节点，并遍历它们-Achieved with the java binary tree cutting, so that the child nodes of a binary tree can be split into a new child node, and traverse them
establishment
- 二叉树建立与遍历源代码，这是我在大二时候做的实验报告，编译调试通过。-Binary Tree Traversal establish the source code, which is in his sophomore year when I do the experiment report, compiled through debugging.
BinaryTree
- 根据前序和中序建立二叉树，输出后序遍历结果-According to pre-order and in order to establish a binary tree, the output results of post-order traversal
BinTreeRun
- Java二叉树的遍历，提供了源代码，在文本中-Binary tree traversal, the source code provided in the text
ThreeOrder
- 本代码用于求二叉树的前、中、后序遍历序列，可以自定义二叉树的保存形式，比较方便快捷。-Find before, during and after the traversal sequence of the binary tree
Tree
- 基于java的生成二叉树程序。可进行前序遍历、中序遍历、后序遍历-Java program based on the generation of binary tree. Can be pre-order traversal, inorder traversal, postorder traversal
java-programme
- 此程序实现了二叉树的遍历，并计算向二叉树插入或删除n个随机字符串时所消耗的时间-This program implements a binary tree traversal, and calculate the binary tree insert or delete a random string of n the time consumed
MakeBinaryTree
- 根据先序遍历和中序遍历生成后序遍历，产生二叉树-According to a preorder traversal and the preorder traversal to generate the total post-order traversal, resulting in a binary tree
binatytree
- 二叉树后序遍历 ，java 编写的二叉树后序遍历演示程序，非常直观。容易理解-Binary tree postorder traversal, java binary tree postorder traversal written demo program, very intuitive. Easy to understand
BiTree77
- 数据结构 二叉树 前序遍历 中序遍历 后序遍历 结点-Pre-order traversal binary tree data structure in-order traversal post-order traversal node
tree
- java实现二叉树的相关操作，二叉树的建立，二叉树的先序遍历后序遍历中序遍历的递归以及非递归实现。-Java realize binary tree related operation, the establishment of the binary tree, binary tree s first traverse sequence after traverse sequence of traverse sequence of recursion and the recursive real
binary_tree-by-lxz
- 构建二叉树，实现查找，删除，遍历，添加这些功能。可视化-Build a binary tree lookup, delete, traverse, to add these features. Visualization
BinaryTree
- 二叉树的定义和前序，中序，后序，层次遍历。包括递归的写法和非递归的写法。附有部分注释！-The definition of a binary tree and preamble, inorder, postorder, level traversal. Including wording of recursive and non-recursive written. With some notes!
tree
- 用JAVA构造的一颗简单的二叉树，并实现它的中序、前序、后序遍历。-JAVA constructed a simple binary tree, and its inorder, preorder, postorder traversal.
complete-binary-tree--traversal
- 完全二叉树的前序、中序、后序、层次遍历 使用JAVA实现 精确简洁 使用最小的空间实现最全的功能-Complete binary tree before order, in sequence, after the level traversal using JAVA achieve accurate and simple to use minimal space to achieve the most complete functionality
Test
- 实现一个二叉树 实现添加、删除、查找、遍历功能 -A binary tree Achieve add, delete, search, traversal function
HufEncoding
- java 实现读取英语文章，建立二叉树，程序自动统计每个个字母的使用频率（中序遍历输出每个字符），最后输出所有字母的以二进制表示的哈夫曼编码。-java read articles in English, the establishment of a binary tree, the program automatically statistical frequency of use of each letter (the preorder output for each character),
bitnode
- 实现二叉树的1.树状输出2. 先序遍历二叉树3. 中序遍历二叉树 4. 后序遍历二叉树5. 输出叶子结点6. 输出叶子结点个数7.输出二叉树的深度。内含说明文档-Achieve binary tree 1 tree output 2. Preorder tree traversal 3. Traversal of binary tree 4 after traversing Binary 5.Output leaf node 6 Output leaf node number 7. Output