अमूर्त

On generation algorithm of prefix code-based postorder traversal tree and its application

Meixia Tang, Yu Liu

The paper strives to solve nodes structural relationship, and can effective produce traverse tree’s subtree and so on, therefore the paper proposes a kind of unified nodes and data structure prefix coding heel traverse tree generative algorithm, the algorithm is helpful for fuzzy searching and systematic analysis seeking, in addition, the algorithm doesn’t need any special requirements in running period, each node branch can be different, so the algorithm is a kind of general algorithm, it can construct subtree in case don’t increase complicated extents, by experiment, it can get the algorithm is obviously superior to traditional algorithm, so verify it by concrete experiments, and get the algorithm is convenient and effective.