资源列表
enhancedBST
- 增强二叉搜索树是二叉搜索树的一种推广，其中每个结点除了保存关键字外，还保存了 以该结点为根的子树的结点数目（包括该结点本身）。通常我们使用链式结构来存储二叉搜索树。在本实验中， 我们要求使用链式结构实现增强二叉搜索树，并实现其建立、复制、前/中/后序遍历、层高统计、结构从属判断等操作。-Enhanced binary search tree is a generalization of a binary search tree, where each node except to save th
TicketQue-lgood
- C++ 写的 基于队列的火车站购票系统，可以与数据库连接，可以加图形界面，可以改变成真实项目-C++ wrote train station ticket queue-based system, you can connect to the , you can add a graphical interface, it can change into a real project
Expression-evaluation
- 利用堆栈 ，来进行表达式求值，但是是以#结束的-Use the stack, for expression uation, but on# ended
In-the-jungle-road
- 丛林中的路，利用最小生成树的prim（普利姆）算法，找最小值-Jungle road, using the minimum spanning tree prim (premium) algorithm, to find the minimum value
HuffmanCodeTree
- Huffman编码树，也是最优二叉树，这个程序是用的huffman编码来编程的-Huffman coding tree, which is the most optimal binary tree, this program is to use Huffman coding to programming
mina-maleki
- THIS CODE IS IDENTFICATION SYSTEM BY DATA EXCEL IN MATLAB WITH ARX MODEL
C_program
- 哈希表，数据结构，C语言，哈希表对编程算法很有帮助-Hash tables, data structures, C language programming algorithm hash table helpful
Longest-Palindromic-Substring
- 这是一个求最长回纹序列的c++算法，简单易懂，感兴趣的可以-This is a request fret longest sequence c++ algorithm, easy to understand, are interested can look at
Int-to-Roman
- 这是一个将整形数据转化为罗马数的算法，简单易懂感兴趣的可以-This is an integer data into the number of Roman arithmetic, straightforward interested can take a look at
finmedian
- 这是一个求数组中值的c++算法，简单易懂，感兴趣的可以-This is a request c++ algorithm values in the array, easy to understand, are interested can look at
balancedtree
- 这是一个可以检测二叉树是否为平衡二叉树的算法，简单易懂，感兴趣的可以-This is a binary tree can detect whether a balanced binary tree algorithm, easy to understand, are interested can look at
happynumber
- 这是c++中求快乐数的一个算法，简单易懂，感兴趣的可以-This is an algorithm c++ seek happy number, easy to understand, are interested can look at