搜索资源列表
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
tree
- java实现二叉树的遍历非递归版,比较容易实现的。-java achieve binary tree traversal non-recursive version, relatively easy to achieve.
binary-tree
- 二叉树的基本功能:1.生成一棵以二叉链表存储的二叉树bt (节点树可自定义)2.用递归方法前序、中序、后序遍历bt,并以缩格形式打印bt上各结点的信息3.交换bt上的所有左右子树,并以缩格形式打印出交换前-The basic function of a binary tree: a tree in order to generate a list stored in binary binary bt (node tree can be customized) 2 be
BTree
- 利用java实现二叉树数据结构,完成成员函数进行先序、中序、后序、降序四种方式遍历二叉树。-Using java to achieve binary tree data structure, completed member function first order, in sequence after sequence, descending four ways binary tree traversal.
TreeTest2
- 给定一棵有n个结点的二叉树,结点的编号为0~n-1。请你编写程序输出二叉树的前序遍历序列。 Input 输入的第一行是一个正整数t(1 < t < 20),表示有t组测试用例。 对于每组测试用例,第一行是一个整数n(0 < n < 20),表示二叉树结点个数。第二行是一个数r(0≤r≤n-1),二叉树根结点的编号。后面有n-1行,表示二叉树n-1条边的信息。每行三个数a,b,c,三个数间由空格隔开,其中0≤a,b≤n-1且a≠b, c为0或1。a表示边的起点,
TreeProject
- 建立二叉树,前后中序遍历二叉树,求二叉树的深度-create a binary tree, traverse binary tree by preorder,centerorder,postorder, and get depth of binary tree