本工程包含二叉树和图的相关基本操作，源码包括二叉树的前序、中序、后序、层次遍历，求树高和树宽，创建、删除二叉树或某个结点，通过前序和中序序列得后序序列；图的创建（邻接矩阵或邻接表表示），深度优先和广度优先搜索，求关键路径，普里姆算法求最小生成树等，放到Visual C++工作区即可使用。(This project contains the basic operation of the binary tree and the graph. The source code includes the preorder, inorder, postorder, level traversal of the binary tree, tree height and tree width, create and delete binary tree or a node, through the preface and inorder sequence create postorder sequence; graph creation(the adjacency matrix or adjacency list representation), depth-first and breadth-first search, find the critical path, and find the minimum spanning tree based on the Prim algorithm, all of which can be used in the Visual C ++ workspace.)