数据结构示例。适用于对数据结构有一定基础的人研究练习

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.

数据结构关于二叉树操作的源码-code of the data structure on the application of bintree.

分别用C语言和C++语言写的用于三角网格划分的算法。划分效果和速度都不错-Were used C language and C++ language written for the triangular meshing algorithms. Into the effectiveness and speed are good

程控交换机电话自动计费软件，开发环境PB，无密码-program- controlled telephone switches automatically billing software development environment PB, without passwords

/*最大k乘积问题 问题描述: 设I是一个n位十进制整数。如果将I划分为k段，则可得到k个整数。这k个整数的乘积称为I的一个k乘积 。 试设计一个算法，对于给定的I和k，求出I的最大k乘积（n

班级管理信息系统 课程设计-class management information system design courses

java客房管理系统-java客房管理系统！！！！！！！！！！

1．定义二叉树的链式数据结构。 2．编写函数，创建下图所示的二叉树。 3．编写函数输出二叉树的先序、中序、后序遍历。-1. The definition of binary tree data structure chain. 2. Write a function, create a binary tree as shown in figure below. 3. Write function, the output of the first binary sequence, in order, postorder traversal.

C语言编写的栈操作模板。包含栈的9种基本操作，从栈的创建、栈的判断到入栈、出栈操作，以及栈的删除等操作。-C language template stack operation. Stack contains 9 kinds of basic operation, from the stack to create, to determine the stack入栈, a stack operation, and stack operations such as delete.

数据结构中的马塌棋盘问题-data structure of the fallen horse chessboard problems