搜索资源列表
Binary_Sea1792619122004
- this code not only show you Binary Search Tree, but also asm code for move your mouse!
common-1.2.16.tar
- The UCL common multimedia library implements a number of algorithms and protocols needed by a number of our applications. It compiles standalone on a range of Unix systems (Solaris, Linux, Irix, FreeBSD, MacOSX) and on Windows 95/98/NT/XP. The fol
Hashbasedrouting
- 这是基于哈希函数的路由表的算法，对路由表的熟悉有很大的帮助。希望大家-Hash-based routing table and binary tree search algorithm
ConvertLength
- VC++编的查找最小二叉树的算法 很简洁 效率很高 是不可多得的好代码-VC++ for the smallest binary tree search algorithm is very simple and efficient is a good source rare
prefix_tree
- 用于ip地址管理的二叉前缀树实现，按前缀区分ip地址，用于存储中型前缀列表-Ip address management for the binary prefix tree to achieve, according to differentiate between prefix ip address prefix list used to store medium-sized
XML
- XML解释器的算法实现，用来显示一个二叉树-XML interpreter algorithm is used to display a binary tree
BST
- 用二叉查找树对动态查找表的设计与实现，基本操作包括：构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素。-Binary search tree with the dynamic look-up table design and implementation of basic operations including: construction empty table, destroy the table, the search element of th
axiom
- Axiom 是一个基于StAX、兼容XML Infoset的对象模型，which supports on-demand building of the object tree. It supports a novel "pull-through" model which allows one to turn off the tree building and directly access the underlying pull event stream. It also has built i
mfc_socket_tree
- 客户端用MFC写的。客户端输入起点和终点和路长。服务器就会生成深度优先二叉树。还在客户端上显示树状结构-Client written using MFC. Client input start and end points and long road. The server will generate a depth-first binary tree. Also displayed on the client tree
RangeEncoding_pdf
- 区间编码算法的分析与实现(论文全文) 摘要：全面介绍了区间编码算法的理论基础和实现方式。详细讨论了区间编码原理、正规化操作、区间编码实现、二进制索引树的理论和实现等技术。并给出了一个切实可行的应用程序。-Range encoding algorithm analysis (full paper) Abstract: The comprehensive range encoding algorithm theoretical basis and implementation. Discus
arry
- 实现在一个矩形区域内的无线网络节点管理。每个节点包含x，y，data按照data大小构成平衡二叉树并进行增删查检操作-Wireless Network Node Manager in a rectangular area. Each node contains the x, y, data according to the data size to constitute a balanced binary tree, and the additions and deletions of sear
2
- 二叉树的查找和替换，在实验室条件下模拟数据结构中的二叉树并且用c语言实现-Find and Replace binary tree, binary tree the analog data structure in laboratory conditions and c language
rcx
- 一个E语言二叉树的读取源代码，通过学习，基本上能掌握一般游戏二叉树的读取。-E language binary tree to read the source code, can basically grasp the general game binary tree the read through the study.
BST
- 用二叉查找树对动态查找表的设计与实现，基本操作包括：构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素。-Binary search tree with the dynamic look-up table design and implementation of basic operations including: construction empty table, destroy the table, the search element of th
tree
- 对二叉搜索树的C#实现，有增，搜，删的功能-Binary search tree of the C# to achieve, there are increasing found, delete function
tree-4.c
- 二叉树查找代码，每层两个孩子 一共五层 自己写的 欢迎下载-Find binary code, a total of five two children each write their own are welcome to download
huofuman
- 给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。-Given n weights as a leaf node n, and construct a binary tree, if the weighted path length to a minimum, said such a binary tree is optimal binary tre
binary-tree
- 1）按照先序序列建立下图所示二叉树的二插链表树，结点元素类型取字符型，树的字符序列从键盘逐个输入。 2）在第1）步建立好的二叉链表树上实施前序、中序和后序递归遍历，并输出相应遍历序列。 3) 在第1) 步建立好的二叉链表树上实施前序遍历的叶子结点输出及其个数统计。 4）在第1）步建立好的二叉链表树上实施中序非递归遍历，并输出相应遍历序列(选做) 5）中序线索化第1）步所建立的二叉链表树，中序遍历所建立的线索二叉树，并输出遍历结果(选做) -1) the establishme
TcpServerDemo
- 一个简单的socket程序，具有服务器和客户端，对于socket入门具有很好的效果- A simple socket program, with the server and client, the entry for the socket has a good effect a painting balanced binary tree method
ip2region-1.3-release
- ip2region是准确率99.9%的ip地址定位库，0.0x毫秒级查询，数据库文件大小只有2.7M，提供了java, php, c, python,nodejs,golang查询绑定和Binary,B树,内存三种查询算法，妈妈再也不同担心我的ip地址定位！(Ip2region is a IP library address location accuracy of 99.9% millisecond, 0.0x query, database file size is only 2.7M, P