一个新的二叉树的轮廓线索树构造算法

A New Constructive Algorithm of Contour Threaded Trees for Binary Trees

本文给出了二叉树的轮廓线索树的一个新的构造算法 .与 Reingdd的算法相比 ,该算法简单、高效、便于分析 ,易于推广到

In this paper, the authors present a constructive algorithm of contour threaded trees for binary trees. The algorithm is not simply removal of recursion of Reingold's algorithm, it is a completely new algorithm. Comparing to Reingold's algorithm,the algorithm is more simple?efficient and can be analyzed easyly.It is easy to extend the algorithm to the constructive algorithm of contour threaded trees for m-arytrees.