| 一个新的二叉树的轮廓线索树构造算法 |
| |
| 引用本文： | 黄竞伟,康立山,陈毓屏.一个新的二叉树的轮廓线索树构造算法[J].小型微型计算机系统,2002,23(4):431-434. |
| |
| 作者姓名： | 黄竞伟 康立山 陈毓屏 |
| |
| 作者单位： | 1. 武汉大学,计算机学院,湖北,武汉,430072
2. 武汉大学软件工程国家重点实验室,湖北,武汉,430072 |
| |
| 基金项目： | 国家自然科学基金 ( No.6 0 1330 10,No.6 0 0 730 43)项目资助 |
| |
| 摘 要： | 本文给出了二叉树的轮廓线索树的一个新的构造算法 .与 Reingdd的算法相比 ,该算法简单、高效、便于分析 ,易于推广到 m-叉树的轮廓线索树的构造算法上
|
| 关 键 词： | 二叉树 线索树 算法 |
| 文章编号： | 1000-1220(2002)04-0431-04 |
A New Constructive Algorithm of Contour Threaded Trees for Binary Trees |
| |
| HUANG Jing-wei ,KANG Li-shan ,CHEN Yu-ping.A New Constructive Algorithm of Contour Threaded Trees for Binary Trees[J].Mini-micro Systems,2002,23(4):431-434. |
| |
| Authors: | HUANG Jing-wei KANG Li-shan CHEN Yu-ping |
| |
| Affiliation: | HUANG Jing-wei 1,KANG Li-shan 2,CHEN Yu-ping 2 1 |
| |
| Abstract: | 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. |
| |
| Keywords: | binary trees threaded trees algorithms |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
