搜索资源列表
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
HUFFMANTREE
- 哈夫曼树是又称最优二叉树，将关键词被搜索的次数看成是哈夫曼树的权值，通过构建哈夫曼树，快速归类，并且通过哈夫曼编码方式无歧义的储存各个关键词。为各个关键字设计哈夫曼编码，使得关键字能无歧义的储存。 内含说明文档-Huffman tree is also known as the optimal binary tree, the number of times the keyword is searched as a Huffman tree weights by constructing t
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
Graph
- 二叉树的无向图、有向图、网的构造与使用-Binary undirected graph, directed graph, the network
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.
Same-Tree
- Given two binary trees, write a function to check if they are equal or not. 判断两个二叉树是否相同-Two binary trees are considered equal if they are structurally identical and the nodes have the same value.