pb 源码 实用例子 取硬盘序列号

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

这个源代码是二进制，八进制，十进制数字之间的互相转换。

本程序是在Turbo c 下运行的,主要完成基数排序功能 -This procedure is running under Turbo c, the main function of the completion of Radix Sort

一个不错的宾馆管理系统-a good hotel management system

数据结构的课后练习-Data structure of the after-school practice

图书管理系统源代码及报告分析，图书管理系统源代码及报告分析-Library management system source code and reports analysis, library management system source code and reports analysis of

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

这个是关于荒岛野人的算法实现，有什么问题请留言-the savage wasteland of the algorithm to achieve and what problems they please leave

数据算法，凉东问题-data algorithm, the cooler East problem