Insert-and-delete-binary-sort-tree

NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )

数据结构：抽象数据类型的介绍；讲述如何构造函数和如何实现；(Data structure: the introduction of abstract data types on how to structure function and how to achieve )

说明：  用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)

魔王语言：输入一串字符，可自动翻译成一串语言。(the program of language)

A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)

此代码为折半查找算法，适用于有序表，欢迎各位下载(This code is the binary search algorithm for ordered lists )

一本介绍各种算法的经典书籍，计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)

最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )

数据结构中图的存储结构的建立与搜索 建立图的二种存储结构 在不同的结构上实现遍历 (Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)