数据库查询示例程序 　数据库查询示例程序 　

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作-focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation

二叉数先序循环的非递归实现，一般先序循环都是由递归实现的，按照完全二叉树格式输入字符型结点值-binary sequence a few first cycle of non- recursive, the general first order recursive cycle are achieved, In accordance with the format completely binary tree node input character values

网络求职招聘人才网站系统正式版（源码），MS SQL数据库，附安装视频，无功能限制完全版-Job recruitment Web site an official version of the system (source), MS SQL database, with the installation of video, full version without functional limitation

使用PB实现取得多网卡ip GetIP支持多网卡-More than the realization of the use of PB card adapter supports multi-ip GetIP

简单的计算器,暂时不支持复杂的函数如,三角函数等-A simple calculator, temporary does not support the complex functions such as trigonometric functions, etc.

#include #include struct BiTNode           //定义二叉树结构体 {   float data;   struct BiTNode *lchild;   struct BiTNode *rchild; }; //二叉树创建函数 struct BiTNode *CreateTree(float *preorder,float *inorder,int lenth) {     float *p,*q;      

java数据结构方面的，关于二叉树，很简单、实用-data structure, for the binary tree, a very simple, practical

哈夫曼编码 很小的程序 数据结构的-Huffman coding procedures small data structure

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.

数据结构经典算法，c源码，很齐全的，对学习数据结构很有帮助。-c program，