baiji

数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)

普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)

从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)

二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）(Chain store binary tree, preorder traversal and hierarchy traversal.)

经典的 数据结构问题 八皇后问题。问题是在8*8的棋盘上放置棋子，要求每条直线上不能出现两个或以上的棋子。(The classical data structure problem Eight queens problem.Question is placed on the 8* 8 board piece, requirements on each line cannot appear two or more pieces.)

在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)

以太网首部的一个c语言程序，代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)

分析汉诺塔，选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)

KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)

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