python-data-structure

数据结构树的实现、增加、删除树、查找元素、遍历树、计算树的深度。(Tree data structure, add, delete tree, find elements, traverse the tree, the tree depth calculation.)

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

用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree

堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子 算法平均时间复杂度: O(nlogn) -HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)

排课表，对于给定的课程及其先序关系，给出所需学期数最少的排法。-Course Scheduling table, for a given sequence of courses and their relationship first, given at least the required number of semester scheduling method.

用C++语言实现的八数码问题，A*算法。-With C++ Language realize eight digital problem, A* algorithm.

说明：  由数字1和0组成迷宫，0代表可走路径，程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)

这是在MATLAB上的SIMULINK中实现的雷达系统仿真实例,用户可以自己设定目标距离,方向等参数,()

控制问题骑士骑士骑士控制控制问题骑士骑士骑士控制问题骑士骑士骑士控制问题骑士骑士骑士控制问题骑士骑士骑士控制问题骑士骑士骑士控制问题骑士骑士控制问题

N-皇后问题线性时间算法 O(n)复杂度，非O(n^2)的，使用的是构造法。-N-Queen problem of linear time algorithm