DFS

二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

《数据结构教程》，李春葆蒋晶钰版，实验2.6，C语言版(Data Structure Course, Li ChunBao,Jiang JingYu version, experiments 2.6, C language version)

一个表达式和一个二叉树之间，存在着自然的对应关系。写一个程序，实现基于二叉树的表示的算术表达式Expression的操作。 基本要求 1.ReadExpr（E） 以字符序列的形式输入语法正确的前缀表示式并够着表达式E。 2.WriteExpr（E） 用带括弧的中缀表达式输出表达式E。 3.Assign（V,c） 实现对变量V的赋值（V=c）,变量的初值为0。 4.Value（E） 对算术表达式E求值。 5.CompoundExpr(P,E1,E2) 构造一个新的复合表达式（E1）P(E2)。 (Between an expression and a binary tree, there is a natural correspondence relationship. Write a program to achieve the operation of the binary tree-based representation of the arithmetic expression Expression. The basic requirements for input grammatically correct prefix expressions 1.ReadExpr (E) in the form of a sequence of characters and enough with the expression E. 2.WriteExpr (E) output expression E infix expression with parentheses. 3.Assign (V, c) the assignment of the variable V (V = c), the initial value of the variable to 0. 4.Value (E) E evaluates arithmetic expressions. 5.CompoundExpr (P, E1, E2) to construct a new composite expressions (E1) P (E2).)

将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现(Convert an array to Haffman code)

程序中含有各种排序算法，包括了数据结构的常见算法，在处理一些排序的问题时由很大帮助(the program has several sort methods which are useful in solving problems.)

说明：  c编写的链表连接函数，上课时学的，上传试试 (c write the list to connect function, class, learn, try uploading)

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

猴子选大王是个重要问题猴子选大王是个重要问题猴子选大王是个重要问题(houzixuandawang)

大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)

本例主要设计查找的有关算法，例如有序表的查找和顺序标的查找，顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)