一种新的树的遍历方法

A New Method of Traversing Tree

树是一种非常重要的非线性的数据结构,对它的遍历一般有三种方法:先根序遍历、后根序遍历和按层次遍历.但在实际应用当中,我们可能需要不同于以上三种方法中的任何一种,这就要求我们对树的遍历不能仅仅有以上三种方法.提出了一种新的树的遍历方法,并且还给出了非递归算法的详细描述,以及算法的时间和空间的复杂度分析.

The tree is a very important non - linear data structure, and there are three methods of traversing tree： preorder traversal, postorder traversal and traversal with level. But in different applications we probably need a traversal sequence that is different ent with any one in those three methods, this needs more than three methods of traversing trees. This article proposes a new method of traversing tree, and it is different with any one in those three. And this article also has given the particular description of non - recursion algorithm of this method and the analysis of time and space complexity to the algorithm.