| 二叉树的一个线性时间 h-v 画树算法 |
| |
| 引用本文： | 付宁亚,黄竟伟,姚爱国. 二叉树的一个线性时间 h-v 画树算法[J]. 武汉大学学报(工学版), 1997, 0(5) |
| |
| 作者姓名： | 付宁亚 黄竟伟 姚爱国 |
| |
| 摘 要： | 介绍二叉树ｈ－ｖ画法的概念，给出二叉树的一个线性时间ｈ－ｖ画树算法，并给出一个应用实例．
|
| 关 键 词： | 二叉树；算法；画法 |
A Linear Time h-v Drawing Algorithm of Binary Trees |
| |
| Fu Ningya. A Linear Time h-v Drawing Algorithm of Binary Trees[J]. Engineering Journal of Wuhan University, 1997, 0(5) |
| |
| Authors: | Fu Ningya |
| |
| Affiliation: | Fu Ningya(Computer Centre) Huang Jingwei(Department of Computer Science and Technology) Yao Aiguo(Computer Centre) |
| |
| Abstract: | The concept of h-v drawing of a binary tree is described.A linear time h-v drawing algorithm of binary trees is presented.An application instance is given too. |
| |
| Keywords: | binary tree algorithms drawing |
| 本文献已被 CNKI 等数据库收录！ |
