red-tree

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

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

数据结构的一些简单的排序算法，有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)

COM中使用SAFEARRAY数组例程，代码中给了两种数组的用法，一种是字符串数组，另一种是自定义数据结构数组。 (use COM SAFEARRAY array routines, a code for the use of two arrays, a string array, and the other is from the definition of array data structure.)

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

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.)

数据结构课程作业，查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)

B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)

说明：  《妙趣横生的算法》第三部分原书附带代码程序，绝对属实(&quot Algorithm for fun,&quot the third part of the original program with the code, the absolute truth)

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)