链表中头结点的应用  

Application of Head Node in Linked List

作　　者：唐艳琴[1] 张欣星[1] 吴永芬[1] 

机构地区：[1]解放军理工大学指挥自动化学院,南京210007

出　　处：《现代计算机》2009年第11期80-82,共3页Modern Computer

摘　　要：链表是一种非常重要的数据结构,很多教材对链表的基本操作进行过算法描述,建立的是不带头结点的链表,学生普遍感觉太复杂难以上机操作,而使用带头结点的链表可使这些算法结构更简单、思路更清晰。通过比较带头结点与不带头结点的单链表和循环链表的插入、删除和访问等基本操作,说明带头结点的链表算法简单、易懂并容易实现。Linked list is very important in data structure. Many books describe basic operations of linked lists with no head node, the students feel complex to the algorithms, and linked lists with head node make algorithms simply. By the comparison with the insert, delete, visit etc basic operations of singly and cyclic linked lists with head node and no head node, shows that the algorithms about linked lists with head node is simple and easy to comprehend and realize.

关 键 词：链表 头结点 首元结点 算法 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]