american_heritage

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

背包算法的c++简单实现，很有用的，可以看看(Knapsack algorithm)

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

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

线性表的链接实现可利用单链表来实现，每个节点存储一个元素。 利用单链表来实现线性表的元素的插入，删除，修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)

已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)

C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)

数据结构 银行模拟问题 (Bank of simulation data structure problem)

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

数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)