摘要
链表是数据结构中的重要概念,利用指针处理链表是教学中的一个难点。为此,对链表的插入、删除方法进行了的分析,找出了问题的关键,总结了操作过程中的实现方法和技巧,以帮助学生学习和理解该部分知识。
Linked list is an important concept in data structure, and it is a difficult point in teaching to operate on linked lists using pointer. Therefore, we analyze the insertion and deletion methods in linked lists, find out the crux of the problem, and summarize the implementation methods and techniques in operating process for helping students learn and understand the part of the knowledge.
出处
《计算机时代》
2011年第9期36-38,共3页
Computer Era
关键词
链表
指针
插入
删除
linked list
pointer
insertion
deletion