摘要
线性单链表是线性表最基本的一种存储形式,分析它有助于增强在数据处理过程中对数据的抽象能力。文章分析了线性单链表的基本操作:建立、查找、插入和删除并附以图示和相应算法,使读者可以形象轻松的学习它。
Linear single linked list is a basic storage form of Linear list, the anyse on which can strengthen the readers ability of abstracting data in the process of dealing with data. In this paper, the writer has analysed the basic operation of linear single linked list on establishment, search, insertion and deletion with graphs and algorithms, which can help the readers study more easily.
出处
《山西广播电视大学学报》
2008年第1期39-40,共2页
Journal of Shanxi Radio & TV University
关键词
线性单链表
结点
算法
linear single linked list
node
algorithm