摘要
通过分析与研究广义表与有序树之间的关系和性质,并在相关文献对广义表的研究基础上,提出了基于有序树的广义表表头、表尾、长度和深度的定义,并根据有序树的二叉链表表示法对以上定义进行算法设计.
Based on the relationship and the feature between generalized list and ordered tree and the related literatures,a definition of table header,footer,length and depth based on ordered tree list was proposed.According to ordered binary tree representation list,the algorithm design for the definition was performed.
出处
《海南大学学报（自然科学版）》
CAS
2011年第3期226-230,共5页
Natural Science Journal of Hainan University
基金
安徽省自然科学基金项目资助(11040606M151)
关键词
有序树
广义表
算法设计
ordered tree
generalized list
algorithm design
