摘要
顺序映象和链式映象是树形数据的两种基本存储结构，本文介绍了它们相互转换的方法，给出了转换方法的ＰＡＳＣＡＬ算法描述，并对算法的时间和空间耗费做了简单分析。
wo of the basic storage structures of the tree are the sequcntial mappingand linked mapping. In this paper,a methed of transforming of them is introduced,algorithms in PASCAL representing the method are given. The time Complexity and spaeecomplexity of the algorthm are analysed at the end of the paper.
