二叉树的先序遍历，使用栈实现（构造空栈，初始化栈）

用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树-With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree

数据结构、算法 矩阵运算程序-data structure, algorithm matrix calculation procedures

实现树的创建算法，创建一个至少包含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.

用C++编写控制台程序，实现学生成绩管理系统，对学生信息的增删改查等操作。使用链表等数据结构，基于控制台实现。

是一个表达式求值的算法，用 模板实现的，可以进行四则运算，支持小数和括号-is an expression evaluates the algorithm, using the template, can be four operators, and parentheses minority support

数据库查询示例程序 　数据库查询示例程序 　-Procedures database query database query examples of sample programs

利用简单优先法输出逆波兰式 将中缀式转化成逆波兰式-priority method using simple inverse Polish exports of Chinese-grade into reverse Polish

希望大家能多多指教这是我给我们同学编的系统-hope that we can enlighten a lot to me this is part of our classmates system

Fir filter的设计,FIR滤波器系数-Fir filter design, FIR filter coefficients

数据结构 基础要好-better data structure foundation