在分析广义表(Generalized list)的抽象数据类型定义、特点和存储结构的基础上,提出了广义表的二叉链式存储表示(称之为广义二叉链表,Generalized Binary Linked List,简称GBLL)。广义二叉链表是对广义链表的一种改进,它有利于广义表的推广和应用。此外还给出了若干个基于广义二叉链表的算法设计,并分析了算法的时间复杂性。为减少运行时的内存开销和提高算法的执行效率.大多是采用非递归算法实现。
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 runfime and improve the executive efficiency of the algorithm,the non-recursion algorithm is used to realize them.