data structure N-tree algorithm 数据结构算法N叉树二
Because Python doesn't fully support lexical variables, you have to create a data structure to hold the value of n.
因为Python并不完全支持局部变量，你不得不创造一种数据结构，来接受n的值。
The resulted data can meet the requirements of fine structure interpretation and lithologic exploration in terms of resolution and S/N in this area.
应用效果表明，所得资料的分辨率和信噪比均满足该区当前构造精细解释和岩性勘探的要求。
With the improvements in the data structure and realization, the algorithm took O(NlogN)time, where N is the input size.
经过在数据结构和 实现方式上的改进， 算法总体平均时间复杂度为O（NlogN）。
应用推荐