搜索资源列表
linkedBinaryTree
- 用java实现的LinkedList二叉树,内有测试文件。-used to achieve the LinkedList binary tree, which is testing documents.
btzyz
- java数据结构方面的,关于二叉树,很简单、实用-data structure, for the binary tree, a very simple, practical
按层二叉树遍历
- 按层二叉树遍历的一个小的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 prepared by the binary tree data structures, including binary tree each node values, and the subtree target.
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
JAVA二叉树实现
- JAVA二叉树实现
avltree1
- 平衡二叉树 生成,可生成、删除树,还可对一棵树的节点进行插入、排序、删除操作-AVL Tree generator
090619
- 理解二叉树特别是完全二叉树的性质,掌握二叉树的存储结构(二叉链表);熟练掌握二叉树的常用操作算法(初始化、插入结点、删除结点、遍历等);初步掌握二叉树的应用。-Binary tree in particular, to understand fully the nature of binary tree, binary tree master storage structure (List Binary) proficiency in commonly used binary tree alg
datastucture
- 用于数据结构中树的实现,包括二叉树的遍历,创建,以及哈弗曼树的实现-For the realization of the tree data structure, including the binary tree traversal, creation, as well as the realization of the tree Havermann
Expr
- 对数据结构中二叉树的理解,前缀、中缀、后缀的相互转换.-Binary tree data structure understanding, prefix, infix, suffix interchangeable.
btree
- 一个二叉树层次遍历代码,请各位高手指点一二!-Traversal of a binary-level code, or two expert guidance please!
erchashu
- 二叉树 前序,中序,后序遍历 二叉树显示-Pre-order binary tree, in order, after traversing Binary display
Java-data-structures-andalgorithms-
- 《Java数据结构和算法》(第2版)介绍了计算机编程中使用的数据结构和算法,对于在计算机应用中如何操作和管理数据以取得最优性能提供了深入浅出的讲解。全书共分为15章,分别讲述了基本概念、数组、简单排序、堆和队列、链表、递归、进阶排序、二叉树、红黑树、哈希表及图形等知识。附录中则提供了运行专题Applet和例程、相关书籍和问题解答。《Java数据结构和算法》(第2版)提供了学完一门编程语言后进一步需要知道的知识。本书所涵盖的内容通常作为大学或学院中计算机系二年级的课程,在学生掌握了编程的基础后才开
JAVA二叉树算法代码
- 广工数据结构实验,此代码为JAVA版的二叉树代码,可放在eclipse上运行。
Java-binary-tree
- 用Java编写的二叉树的数据结构,包括二叉树的每个节点的值,以及各子树的指针。 -Written in Java binary tree data structure, including the value of each node of a binary tree, and each sub-tree pointer.
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,