- 1、本文档共13页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
数据结构与算法
Data Structures and Algorithms
单链表
Singly Linked Lists
CHAPTER2 Linear List
2.4 Link Storage Structure of Linear List
D
a
t
a
Definitio n : The linear list with link storage structure
S
t
r is called a linked list.
u
c
t
u
r static linked list
e
s
a Implementation
n
d
dynamic linked list
A
l
g
o
r
i singly linked list
t
h
m
s
Link Mode doubly linked list
circularly linked list
2
CHAPTER2 Linear List
2.4 Link Storage Structure of Linear List
D
a
t Singly Linked List :each node has only one pointer field
a
S Node:In order to correctly represent the logical
t
r
u relationship between nodes, it is necessary to store
c
t
u
the value of each data element in the linear list at the
r
e
s same time that indicates the subsequent nodes
a
n address (or location) information, the storage image
d
composed of these two pieces of information is
A
l
g called a node.
o
r used to store the data
i
Data Field:
t
h A singly linked list value of the node
m
s has two fields for used to store the direct
each node Pointer successor address or
Field: location of data elements
Head Pointer : 3
Pointer to
您可能关注的文档
- (2.2)--第一章认识大学-2.ppt
- (2.2.1)--(2)《数据结构》教案.pdf
- (2.2.1)--2.反手拉弧圈球.pdf
- (2.2.1)--2.2SoftwareTeam二十四式中华太极功.pdf
- (2.2.1)--2.2TheObjectOrientationofC二十四式中华太极功.ppt
- (2.2.1)--2.2Thephilosophicalthinkingabout二十四式中华太极功.ppt
- (2.2.1)--2.2成熟势力说二十四式中华太极功.pdf
- (2.2.1)--8.1Basic-1Scanner_en二十四式中华太极功.pdf
- (2.2.1)--Bigdataanalysis2-2Internaldataac二十四式中华太极功.pdf
- (2.2.1)--裁判语言体育与健康.ppt
文档评论(0)