搜索资源列表
BiTree77
- 数据结构 二叉树 前序遍历 中序遍历 后序遍历 结点-Pre-order traversal binary tree data structure in-order traversal post-order traversal node
ch03
- 排序二叉树，对元素的内容进行自动的默认降序排列-Sort binary tree, the contents of the elements in descending order by default automatically
node
- java模拟二叉树的算法，不错哦，来下载吧-java simulation of the binary tree algorithm, Oh, to download
BinaryTree
- 自己编写的关于二叉树的一些基本应用的实现，适合初学者用来学习，通过控制台来进行控制。-I have written some of the basic binary tree applications implementation, suitable for beginners to learn, to be controlled through the console.
compress
- 利用堆、霍夫曼树、二叉树遍历等知识点，编写文本压缩程序，实现文本文件的压缩与解压功能-Using heap, Hoffman tree, binary tree traversal and other knowledge, text compression program, realize a text file compression and decompression functions
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
BinaryTree
- 二叉树类的自己编写，是作为上机实习的题目出现。-Binary tree class to write, the subject appears as-on practice.
binarytree
- 二叉树的学习源码，包括二叉树的构造、插入、删除等操作，还有可视化演示界面，以及二叉树的应——Huffman编码-Binary tree learning source, including the structure of the binary tree, insert, delete operations, as well as the visual presentation interface, and the binary tree- Huffman coding,
binarysearchtree
- 二叉查找树的实现。二叉树由节点构成，另外还有一个测试文件，检测二叉树的性能。-The realization of a binary search tree. Binary tree nodes, in addition to a test file, the performance of the detection of a binary tree.
GenBinTree
- 随机插入的二叉树的实现，有相关的功能实现。-The realization of the random insertion of a binary tree, and related functions.
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!
WordRecoverTool
- 一种基于二叉树数据库模型的分词算法，很好用 -A segmentation algorithm based on binary tree database model, well used
tree
- 用JAVA构造的一颗简单的二叉树，并实现它的中序、前序、后序遍历。-JAVA constructed a simple binary tree, and its inorder, preorder, postorder traversal.
paixu
- 多种排序，各种排序，多种多样，包括最小二叉树，冒泡等-A variety of sort sort are varied and include minimum binary tree, bubbling
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),
BTree
- 平衡二叉树的C++实现，包含树的生成，节点插入，旋转，删除操作。-The balanced binary C++ implementation, contains tree generation, the node insert, rotate, delete operation.
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