Linked Lists - Stony Brook University
Linked Lists
Chapters 5
Fundamentals
? A singly-linked list is a sequence of data elements (of the same type) arranged one after another conceptually.
? Each element is stored in a node. ? Each node also contains a link that
connects this node to the next node in the list.
Fundamentals (cont'd)
? A special link called the head references the first node in a list.
? Some lists may also have a special link called the tail that references the last node in a list.
? A cursor is a link that points to one of the nodes of the list.
? A list may be empty. (i.e. head = tail = null).
Conceptual Picture
data link
12
31
20
head
Node
null
Actual Picture
WORD ADDRESS 1000 1002 1004 1006 1008 1010 head 1012
CONTENTS 31 (2nd number) 1008 12 (1st number) 1000 20 (3rd number) 0 1004
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- 4 3 stacks queues and linked lists university of pennsylvania
- singly linked lists cornell university
- linked list basics stanford university
- linked data structures i singly linked lists
- singly linked list class carnegie mellon university
- doubly linked lists
- lecture 09 structs and linked lists carnegie mellon university
- an introduction to linear linked list knight foundation school of
- linked lists and iterators university of bridgeport
- lecture 11 array of linked lists carnegie mellon university
Related searches
- brook converter
- linked lists in java
- lists of lists epa
- epa lists of lists excel
- doubletree oak brook il
- hilton oak brook il
- hampton inn stony creek virginia
- hilton hotel oak brook illinois
- hampton inn stony creek virginia phone
- sleep inn stony creek va
- richmond surgical arts stony point
- stony point mall richmond va