资源列表
balancedTree
- 平衡二叉树的搭建与维护，构造与基本计算等方面的功能-Build and maintain a balanced binary tree, structure and other aspects of basic computing functions
Main
- 模拟银行系统的框架式代码，包括疲劳值的估计和图形界面-Simulation banking system frame code, including fatigue value estimates and graphical interface
TourOfTheKnight
- 通过这个程序，可以获得对回溯算法的基本理解。在 n × n 方格的国际象棋棋盘上，马(也称为骑士Knight)从任意指定的方格出发，以跳马规则(横一步竖两步或横两步竖一步)，周游棋盘的每一个格子，要求每个格子只能跳过一次。-Through this program, you can get a basic understanding of backtracking algorithms. On the chess board n n squares, Ma (also known as Knig
Input
- 银行营业厅系统中负责数据的读入与分析模块的代码，简洁易用-Banking hall system responsible for data reads and analysis module code, simple to use
StateTrans
- 模拟银行营业厅代码中负责状态改变的模块，代码简单易用，无bug-Analog banking hall is responsible for the state to change the code module, the code is simple to use, no bug
TrasverseGenerateBTree
- 设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。-Binary tree node is set in capital letters, enter the pre-order traversal of a binary tree traversal sequence and generates this binary tree, t
BalancedBinaryTree
- 该程序可以帮助初学者了解AVL树。输入一组关键字序列，并以此顺序建立一棵平衡二叉树，并在建树过程中用逆中序法输出每次插入新结点后的平衡二叉树形状。-The program can help beginners learn AVL tree. Enter a set of keywords sequences and in this order to establish balanced binary tree, and the achievements in the process of usi
Haffman
- 将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现-Convert an array to Haffman code
Partition-tree
- 时代的眼泪-划分树 能在对数时间内求取区间第k大值-Partition tree
Hanoi
- c++版，用链式栈实现汉诺塔算法（内附链式栈内模板）-version of c++，realisation of the tower of hanoi with link stack(class pattern attached)
link_queue
- c++链式队列类模板附带调试菜单 1.生成栈 2.显示栈 3.入栈 4.出栈 5.取出栈顶 -class pattern of link queue in version c++
seq_stack
- c++顺序栈类模板带调试菜单 1.生成栈 2.显示栈 3.入栈 4.出栈 5.去栈顶-class pattern of sequence stack in version c++