bstree_frame

迷宫问题，利用随机数自动生成迷宫，并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )

用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)

基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)

说明：  设计济南大学校园平面图，所含的景点不少于10个。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。 选作内容： 求校园的关节点。 提供图中任意景点查询，即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息，如道路类别，沿途景色等级，一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )

包含了数据结构实现堆栈的方法。 主要有链表实现和数组实现以及堆栈的应用。(This pakcet inclues the programs to implement the stack with chain and array and it s application.)

先序创建二叉树，将二叉树所有节点的左右子树交换，再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)

求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )

算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT(Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT)

数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)

就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)