一种动态建树的方法  

Dynamic method for drawing tree

作　　者：马栋梁[1] 马存宝[1] 张超[1] 张潇[1] 

机构地区：[1]西北工业大学航空学院,陕西西安710072

出　　处：《计算机工程与设计》2006年第18期3373-3376,共4页Computer Engineering and Design

基　　金：西北工业大学研究生创业种子基金项目(Z20040002)。

摘　　要：研究了绘制树状结构面临的难点问题,提出了一种动态构造树状结构的方法,设计了插入、删除节点等操作方法。在此基础上提出了一种高效的画树算法。与其它算法相比,该算法利用节点及子树边界的含义,通过不断调整移动子树来计算节点位置,进而实现在一个较小的区域内画树。该方法可以实时修改树的逻辑结构,并动态计算出节点位置,使得绘出的树即真实的树状结构。最后对该方法进行了时间和空间复杂度分析,对其应用前景进行了展望。The problems of drawing a tree-structured diagram are discussed in this paper. A method of creating a dynamic tree-structured diagram is presented and the node adding and deleting algorith is designed. Based on these, An efficient tree drawing algorithm is designed. Unlike other algorithms, this algorithm uses an explicit representation of node and sub-tree contours and computes node＇s position by repeatedly moving sub-trees. By the way, the position of the nodes is caculated dynamically and the tree can be drawn in a small area. At last, an evaluation and conclusion of this method are given. The application prospect of this method is studied.

关 键 词：树状结构 二叉树 遍历 画树算法 动态建树 复杂度 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]