First, the basic concepts of time and the complexity of the algorithm
Second, the linear form
The definition (2.1) of the linear form, structure and basic operation of the storage
Third, stacks and queues
(3.1) defined in the stack, the storage structure and basic operation
(3.2) define a queue, the storage structure and basic operation
(3.3) ADT (abstract data types)
Fourth, the string
(4.1) defined strings, storage structure and basic operation
(4.2) KMP algorithm
(4.3) Improved KMP Algorithm
V. array, generalized matrix table
(5.1) array
(5.2) Special matrix
(5.3) General List
Sixth, tree
(6.1) define and store Tree
(6.2) defined in the binary tree, the storage structure and properties
(6.3) binary recursive traversal
(6.4) binary non-recursive traversal
(6.5) threaded binary
(6.6) tree and binary conversion
(6.7 ) binary tree and forest conversion
(6.8) and forest tree traversal
(6.9) Huffman trees and Huffman coding