搜索资源列表
Flash-source-file
- 《数据结构》中关于二叉树那一章节的算法的flash源代码-" Data structure" in which the chapter on binary tree algorithm source code flash
01beibao
- 0-1背包问题，空间点对问题，图形压缩，线性时间选择以及最优二叉树的java脚本程序-0-1 knapsack problem, the point of the problem space, image compression, linear time optimal tree selection and java scr ipt program
zuiyouerchashu
- 最优二叉树的Java脚本文档，采用的是图搜索策略。-Optimal binary tree of Java scr ipt document, using the map search strategy.
binarytree
- 使用java实现二叉树，功能包括插入，删除，查找等功能-Use java binary tree, features include insert, delete, search and other functions
AVL
- 利用Java语言编写的Java平衡二叉树，适合初学者学习Java时作参考资料-As a reference when you use the Java language Java balanced binary tree, suitable for beginners to learn Java
BinaryTree
- 在二叉树中实现以下功能：1.输出叶子结点和叶子结点数；2.交换左右子树；3.验证二叉树的性质3-The following functions are implemented in a binary tree: 1. Output leaf nodes and leaf nodes two exchanged left and right subtrees 3 Verify binary nature of 3
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.
TreeTest2
- 给定一棵有n个结点的二叉树，结点的编号为0~n-1。请你编写程序输出二叉树的前序遍历序列。 Input 输入的第一行是一个正整数t(1 < t < 20)，表示有t组测试用例。 对于每组测试用例，第一行是一个整数n(0 < n < 20)，表示二叉树结点个数。第二行是一个数r(0≤r≤n-1)，二叉树根结点的编号。后面有n-1行，表示二叉树n-1条边的信息。每行三个数a,b,c，三个数间由空格隔开，其中0≤a,b≤n-1且a≠b, c为0或1。a表示边的起点，
TreeProject
- 建立二叉树，前后中序遍历二叉树，求二叉树的深度-create a binary tree, traverse binary tree by preorder,centerorder,postorder, and get depth of binary tree
suanfapaixu
- 蓝桥杯题目算法排序，冒泡排序，二叉树排序-Blue Bridge Cup title Sorting Algorithm
chard
- 实现二叉树中最大数的提取问题，主要运用迭代算法，迭代每一个子问题-To achieve the maximum number of binary extraction problem, the main use of iterative algorithm, iterative each sub-problem
shujujiegou
- 数据结构的实现，包含链表，二叉树等基础内容，想学习的同学可以下载。-Data structure that contains the list, and so on the basis of binary content, the students want to learn can be downloaded.
Greedy_Huffman
- 哈夫曼树的Java实现， 哈夫曼树又叫做最优二叉树，是一种带权值路径最短的树，这种树在信息检索等方面都很重要。-Huffman tree Java implementation, optimal binary tree Huffman tree is also called, is a weighted value of the shortest path tree, this tree is very important in information retri and so on.
javabinarytree
- 个人写的基于java基本语法的二叉树实现-Personal write basic grammar java based Binary Tree
BalancedBinaryTree
- BalancedBinaryTree 平衡二叉树 java实现 适合初学者 欢迎大家交流分享-BalancedBinaryTree java achieve a balanced binary tree is suitable for beginners are welcome to share exchange
the-universitys-class-design
- 商品库存管理功能,二叉树的遍历，类的封装和继承，数据库应用设计-the manage of supermarket
DataStructure
- java编写的常用的数据结构(二叉树、链表、序列、各种常用排序、栈)-java prepared by the commonly used data structures (binary trees, linked lists, sequence, a variety of the usual sort, stack)
Calculate
- 通过生成二叉树实现计算器功能（加减乘除乘幂）。-By generating a binary tree calculator (addition, subtraction exponentiation).
Tree-From-top-to-bottom
- java 从上到下打印二叉树 -java java binary tree top to bottom top to bottom print print binary tree
tree
- 广义表构造二叉树，静态方法，java实现。采用栈的非递归-Generalized table structure binary tree, static method, java achieve. Use non-recursive stack