搜索资源列表
tree
- 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming
tree
- 实现二叉树的建立，节点的插入，删除，和搜索功能。并在main函数中实现各种功能。-To achieve the establishment of a binary tree, node insertion, deletion, and search functions. In the main function to achieve various functions.
tree-java
- 用java写的二叉搜索树的小例子，初学者看的代码-Written with java binary search tree small example, look at the code for beginners
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
zuiyouerchashu
- 最优二叉树的Java脚本文档，采用的是图搜索策略。-Optimal binary tree of Java scr ipt document, using the map search strategy.
isValidBST
- 判断二叉树是否是二叉搜索树，先找左边的节点，压栈，那么第一个弹出来的为最左节点。右子树类似。 -Determine whether a binary tree is a binary search tree, first find the node on the left, push, then the first pop-up to the most left node. Right subtree is similar.
java3
- 杨之江老师的java课程实习代码 实习三 实现一个二叉搜索树, 提供添加、删除、查找、遍历功能，实现Insert()，delete()，visit(),search()方法- Yang Jiang s teacher internship program code for java Practice three to imple