用单链表结点实现双链表  

Implementing Double Linked List Using Nodes of Singly Linked List

作　　者：王晋利 赵永哲 Wang Jini;Zhao Yongzhe(College of Information Engineering,Shandong Huayu University of Technology,Dezhou 253034,China)

机构地区：[1]山东华宇工学院信息工程学院,德州253034

出　　处：《办公自动化》2024年第13期4-6,13,共4页Office Informatization

基　　金：2023年课堂教学改革示范课程--数据结构(A)(项目编号:17)。

摘　　要：链表是数据结构中最重要的存储结构,由于双向链表与单链表相类似,许多教科书均对此一笔带过,更增加其学习难度;文章从单链表结点类型定义,以及如何用单链表结点结构实现双链表操作进行探讨,最终实现用单链表结点实现双链表。The linked list is the most important storage structure in data structures.Due to the similarity between Double Linked List and Singly Linked List,many textbooks have mentioned this,which further increases the difficulty of learning it.This paper explores the type definition of nodes in Singly Linked List and how to use the node structure of Singly Linked List to implement Double Linked List operations,ultimately achieving the implementation of Double Linked List using nodes of Singly Linked List.

关 键 词：单链表 结点 双链表 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]