yuesehuhuan

编写一个将二叉树的所有叶子结点从左向右链接成单链表的算法(Write a binary tree leaf nodes from left to right links into a single linked list algorithm)

自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)

说明：  数据结构中的顺序表，是其中的一个重要组成部分(The order of the table data structure is an important component of which)

包括链表的各项操作，添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)

数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)

组合数学全排列,包含有六种全排列的方法，字典序法(math of permutations)

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)

c++数据结构中的二分查找树，是比较基本的数据查找结构，查找效率比较高(c++ data structure in the binary search tree, is a more basic data to find the structure to find more efficient)

找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)

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