One-dimensional linear space-based method for implementing trie tree dictionary storage and management

A one-dimensional linear space-based method for implementing trie tree dictionary storage and management. The method comprises the following steps: acquiring complete dictionary data; generating ordered dictionary data and storing in a one-dimensional array; and, establishing a trie tree to implement storage of the dictionary data. The method employs the one-dimensional array instead of a dual array (base [] and check []), thus allowing for serialization and deserialization of the trie tree to be of increased degree of convenience and speed, and allowing for increased efficiency in loading and storage of a dictionary, while at the same time solving the problem of data movement or storage space backtracking found in a trie tree dictionary data storage method implemented with a dual array.