首页 | 本学科首页   官方微博 | 高级检索  
     

广义表的二叉链式存储表示及其算法设计
引用本文:陈海山,吴芸.广义表的二叉链式存储表示及其算法设计[J].计算机工程与应用,2005,41(35):38-41,113.
作者姓名:陈海山  吴芸
作者单位:厦门大学软件学院,福建,厦门,361005;厦门大学软件学院,福建,厦门,361005
基金项目:国家自然科学基金项目(编号:60275023);厦门大学科学研究基金项目(编号:Y07002)
摘    要:在分析广义表(Generalized list)的抽象数据类型定义、特点和存储结构的基础上,提出了广义表的二叉链式存储表示(称之为广义二叉链表,Generalized Binary Linked List,简称GBLL)。广义二叉链表是对广义链表的一种改进,它有利于广义表的推广和应用。此外还给出了若干个基于广义二叉链表的算法设计,并分析了算法的时间复杂性。为减少运行时的内存开销和提高算法的执行效率,大多是采用非递归算法实现。

关 键 词:广义表  链式存储表示  广义二叉链表  算法设计
文章编号:1002-8331-(2005)35-0038-04
收稿时间:2005-07
修稿时间:2005-07

Binary Linked Storage Representation and Algorithm Design of Generalized List
Chen Haishan,Wu Yun.Binary Linked Storage Representation and Algorithm Design of Generalized List[J].Computer Engineering and Applications,2005,41(35):38-41,113.
Authors:Chen Haishan  Wu Yun
Affiliation:Software School, Xiamen University, Xiamen, Fujian 361005
Abstract:The ADT(Abstract Data Type) definition,characteristics and storage structure of generalized list are analyzed.And based on that,the binary linked storage representation of generalized list is put forward(viz.Generalized Binary Linked List,for short GBLL).The GBLL is improved on the generalized list,which is propitious to its application and generalization.Furthermore,some algorithm of the GBLL is offered and their complexities of the time are analyzed.At last,in order to reduce the consumption of the memory in the runtime and improve the executive efficiency of the algorithm,the non-recursion algorithm is used to realize them.
Keywords:generalized list  Linked Storage Representation  Generalized Binary Linked List  algorithm design
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号