tt0202

用c/c++写的二叉排序树的插入与删除，有兴趣的朋友可以看一下(Insertions and deletions using c/c++ to write binary sort tree)

数据结构中，运用链表实现四则括号运算等，运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)

数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)

一个关于二叉树应用的小程序,包括二叉树的建立，前中后遍历等操作(a program about bintree structure)

一道poj上的问题的解答，棋盘上的距离问题。即实现棋盘上从一个点移动到王，后，兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)

说明：  用数据结构的遍历，对于小毛驴过河解决实际问题。(Traversing the data structure used for the small donkey across the river to solve practical problems.)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

关于二叉树的一些相关代码，运用链表的形式，求二叉树的高度，结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)

数据结构课程设计 -电话本（运用了MFC图形化界面）(Curriculum design- the phone book)

自己编写的几种经典的排序算法，里面有自己做的PPT详细讲解，希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)