搜索资源列表
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
Implementing-BSTs
- An important special kind of binary tree is the binary search tree (BST). In a BST, each node stores some information including a unique key value and perhaps some associated data. A binary tree is a BST iff, for every node n, in the tree: All k
Hill-Climbing
- here is the implementation of simple hill climbing in java using a binary tree.
BTExercise
- binary tree exercises lalalla
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.
Flash-source-file
- 《数据结构》中关于二叉树那一章节的算法的flash源代码-" Data structure" in which the chapter on binary tree algorithm source code flash
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
ThreadedBinaryTree
- Implementation od Threaded Binary Tree in Java
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.
BST3_array
- In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tr
javabinarytree
- 个人写的基于java基本语法的二叉树实现-Personal write basic grammar java based Binary Tree
Mini-Dictionary
- this the document of dictionaries binary tree search b-tree is collected by sotrym- this is the document of dictionaries binary tree search b-tree is collected by sotrym