二叉排序树，实现树的各种操作，包括计算深度，找最大值最小值，还有各种遍历的递归算法和非递归算法，以及查找查找树的前驱节点和后继节点-Binary sort tree, the tree to achieve various operations, including the calculation of depth, looking for maximum minimum, there are various recursive traversal algorithm and non-recur

其中的函数FFT用于计算一组数据的快速傅里叶变换，输入参数为一个数组，元素个数为2的n次方。程序包含FFT排序算法和蝶形运算。-Function which Fast Fourier Transform FFT calculation for a set of data, the input parameters for an array of n number of elements in a power of 2. Program includes sorting algorithms an

快排递归算法的实现，测试数据从10000到100000000，并通过计时函数计算不同规模的数据递归快速排序所用的时间-Row fast recursive algorithm, test data 10 thousand to 100 million, and calculate the different sizes of data recursive quicksort time used by the timing function