BinaryTree

自创的彼此交流账目软件，难得的好软件请一定要下来看看。-self-exchange accounts software, a rare good software must please look down.

数据结构 详细描述了如何创建二分查找的方法以及操作-Data structure described in detail how to create a binary search method and the operation of

这是用QB编的排序程序。利用条形显示冒泡排序、快速排序、等五种排序方法。 效果一流，对于C语言，数据结构爱好者是不错的选择。-This is the sort made by QB procedures. Strip shows that the use of Bubble Sort, Quick Sort, five sorting method. The effect of first-class, for C language, data structure enthusiasts is a good choice.

四种排序算法(交换排序 冒泡排序 quick sort排序 mergesort归并排序 )源码，以及各种算法排序效果的对比。-Four kinds of sorting algorithms (exchange sort bubble sort quick sort sort mergesort mergesort ) source code, as well as comparison of various algorithms to sort results.

用C语言写的文件合并，可以合并两个二进制文件-Using C language to write the file merger can merge two binary files

二叉树有一个优雅的递归指针结构，所以他们是一个很好的学习方法递归指针算法。 - Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms.

基于c++的各种算法，能是你在较短时间内掌握编程的精髓-Computing+for+Numerical+Methods+Using+Visual+C++

最长公共子串问题-longest public substrings problems

顺序栈的基本操作，一共9个，与吴伟民数据结构课本完全一致，用C实现-order stack the basic operation, a total of nine, and Xiulan WU Weimin textbooks data structure is fully consistent with achieving C

堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子 算法平均时间复杂度: O(nlogn) -HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)