Summary of design: the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.
概要设计：本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。
The pendant property of tree branches is checked and the order of tree branches is determined step by step, then the linear tree is realized.
它通过判断树支的边缘性质，逐个确定树支的排序，从而实现线形树。
So one should prefer non-linear models like SVM with kernel or tree based classifiers that bake in higher-order interaction features.
因此，每个人都应该选择适合高阶交互特征的带核SVM或基于树的分类器。
应用推荐