基于单链表的多项式的运算

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys

基于数据库的编成，程序是模块化的编写，利用摁钮实现对话框的调用。数据库是SQL-based on the composition of the database, the procedure is the preparation of modular, using pressed the button to achieve box call. The database is SQL

数据结构的一种算法方式,生死游戏 的程序-data structure of an algorithm, the process of life and death game

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

管理

非常典型的递归算法来获得指定的文件夹大小。Win案例中使用API Findfirst FindNext完成。

Delete a node from a tr-Delete a node from a tree...

用数据结构做的约瑟夫问题，其中还包括类似问题中的猴子选大王算法 -do with the data structure Joseph problems, which also included a similar problem is the monkey king algorithm election

一款用C#编写的精简ERP系统，帮你了解ERP系统和C#开发的方法

这是我的功课，与我的朋友。此示例数据库从 dvd 出租店。有 6 个实体，有一个关系 N N，N-1，执行查询，子查询，函数、 包，过程中，光标和触发器。