摘要
提出了一种新而实用的树的父母－子女环存贮结构．该结构明显优于传统树型存贮方法，充分利用了树中的空指针域，很好地体现了树的层次特性，使得遍历、查找父母及子女结点等基本操作简便快捷．在讨论了其定义、性质和基本操作之后，给出了一个三叉Ｈｕｆｍａｎ树算例．
In this paper a new and powerful storage structure for trees is proposed, it is named parentchildren Cycling storage structure. This structure has clear advantages over traditional storage structure, makes good use of the pointer fields, and shows the hierarchic character for trees. This structure makes the trees’ basic operations such as traversing, searching parent and children faster and easier.
出处
《四川师范大学学报（自然科学版）》
CAS
CSCD
1998年第3期361-366,共6页
Journal of Sichuan Normal University（Natural Science）
关键词
树
存贮结构
时间复杂度
数据结构
父母-子女环
Tree
Storage structure
Traversing
Huffman tree
Time complexity T(n)
Space complexity S(n)
