data-structure-paper

some problems about c++.(car.cpp)

数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)

说明：  KMP算法的具体实现，能够在O(n+m)时间内找出字串在父串中的位置，n为父串长度，m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)

说明：  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)

这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)

c-w算法，讲述一种分配运输的节约方法，适合于车辆的调度(c-w algorithm，About one distribution transport saving method, suitable for vehicle scheduling)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

数据结构的一些基本的相关的试验，如二叉树的遍历，打印，如排序算法，检索算法，动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)

先序创建二叉树，将二叉树所有节点的左右子树交换，再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)