搜索资源列表
linkedBinaryTree
- 用java实现的LinkedList二叉树，内有测试文件。-used to achieve the LinkedList binary tree, which is testing documents.
按层二叉树遍历
- 按层二叉树遍历的一个小的java程序 dasfhdakdkjadjakdasds-level binary tree traversal by a small java programs dasfhdakdkjadjakdasds
TestMatrixOperation
- 在java环境中，二元多项式计算完成计算并演示结果以及以二叉树形式进行存储-the environment, complete binary polynomial terms calculated and results of the demonstration in the form of binary tree storage
Java二叉树的后续遍历
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要.-Java two following forks the tree traversal Java two following to fork the tree traversal mainly applies in goes against the Poland -like solution,Is very important in the translation
TREE
- 用java实现二叉树的建立，以及索引功能-Java binary tree implementation with the set up, as well as the indexing
Expr
- 对数据结构中二叉树的理解，前缀、中缀、后缀的相互转换.-Binary tree data structure understanding, prefix, infix, suffix interchangeable.
data_system
- 本程序使用java开发的数据结构演示系统，包括了链表，二叉树，排序以及图的图形界面演示系统，实现了智能化及用户可自行输入数据进行演示。-This program uses the data structure of the java development presentation systems, including linked lists, binary trees, sorting, and a graphical interface presentation systems, inte
curriculum-design
- 二叉树遍历的动态演示 java 前序遍历 层次遍历 中序遍历 后序遍历 图形用户界面-Binary tree traversal dynamic presentation java before preorder traversal hierarchy traversal in preorder traversal after preorder graphical user interface
BiNode
- java实现的二叉树图形演示程序，能够进行添加，删除以及查找父节点等操作。-java implementation of binary graphics demo program that can be added, deleted, and find the parent node and other operations.
1
- 采用java对图片进行压缩，采用哈弗曼编码进行压缩，了解二叉树的作用-To compress images, using the harvard, compress coding
JAVA二叉树算法代码
- 广工数据结构实验，此代码为JAVA版的二叉树代码，可放在eclipse上运行。
thx_soluoion
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要,-Java binary tree traversal follow-up Java binary tree traversal is mainly used in the aftermath of the inverse solution of the polish style, is very important in the compilation,
vehwork
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要,-Java binary tree traversal follow-up Java binary tree traversal is mainly used in the aftermath of the inverse solution of the polish style, is very important in the compilation,
Desktop
- 数据结构 java版本 二叉树的创建 序遍历，中序遍历，后序遍历 +考试题目(Ordered traversal, inorder traversal, backward traversal)
huffman
- 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,