搜索资源列表
RFID-lunwen
- 针对射频识别系统中的标签碰撞问题，提出了一种基于分组策略的RFID自适应防碰撞算法。该算法在二叉树搜索算法的基础上引入分组策略、后退策略、自适应地选择四叉树搜索策略、动态调整标签碰撞检测过程策略，减少了搜索次数和读写器与标签间的通信量，提高了识别效率。-Systems for radio frequency identification tag collision problem, a packet-based strategy RFID adaptive anti-collision algo
5
- 二叉树的三种遍历，求深度、叶子，按层次遍历，-Binary tree traversal, and depth leaves hierarchy traversal
CTree
- 该程序是实现双亲表的算法，主要用于二叉树的应用-The procedure is the algorithm of the parent table, mainly used for the application of the binary tree
zhebanchazhao
- Two forks the tree: binary search, for the realization of two binary tree binary search.
13597362-C-program-for-Binary-Search-Tree-Travers
- code binary search tr-code binary search tree
classical-algorithm-VCPP
- 常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等-The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.
zuoye
- 二叉树遍历，包括前中后序递归遍历和计算椰子树和节点数-Binary tree traversal, including former in after sequence recursively traverse and calculation of coconut trees and the number of nodes
avltree
- 平衡二叉树，平衡因子，四种情况的变换！树的查找，建立！-Balanced binary tree, the balance factor of four cases transform! Tree Find establish!
BinaryTree
- 这是一个数据结构的二叉树排序```不小于5个汉字或10个字母，详细的标题容易被下载。-This is a data structure of the binary tree sorting `` `not less than five characters, or 10 letters, detailed title easily be downloaded.
Cpp1
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
erchashu
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
6BinaryTree
- 利用二叉树实现十进制四则运算，并输出结果-Binary tree decimal arithmetic, and outputs the result.
Graficar_Arbol_General_ED
- Binary Tree, how to graph a binary tree in java Netbeans
arbrebin
- testing a binary tr-testing a binary tree
4
- 编程任务： 对于给定的树，以根结点为起点，对树实现非递归方式广度优先搜索，输出广度优 先搜索序列 数据输入： 由文件input.txt给出输入数据。第1行有1个正整数n，表示给定的二叉树有n个顶 点，编号为1，2，…，n。接下来的n行中，每行有3个正整数a,b,c，分别表示编号为a的结 点的左儿子结点编号为b，右儿子结点编号为c，0表示没有儿子。各结点信息按照层序列表 的顺序给出。-Programming tasks: For a given of t
B013040028_hw_15
- 二元樹應用,利用二分法來創建一顆二元樹,另外也能執行搜尋刪除的功能-Binary tree applications, the use dichotomy to create a binary tree, while also able to perform a search function to delete
mpi-education
- file binary tree run.rarmpi education.rar
LinkList
- 关于二叉树的,list的一些资料,可以用C++来运行-About the binary tree, a list of some of the data, can be used to run the c++
7.Binary-Search-Tree
- 二叉树收索，包括二叉树的遍历，收索，增加，删除等功能-Close binary search
binarytree
- 根据中后续遍历建立二叉树，并且输出其前序遍历-According to the subsequent establishment of a binary tree traversal, and the output of its preorder traversal