此文件夹中共包括十二个小程序

AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除

Boyer_Moore算法的串模式匹配

Horspool算法的串模式匹配

Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历

HeapSort利用堆排序实现优先级队列

Merge实现二路归并排序算法

MFK动态规划解背包问题

nqueue求解n皇后问题

QuickSort快速排序算法的实现。

Shell排序算法的实现。

Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。

tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package