Introduction - If you have any usage issues, please Google them yourself
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