list general linear lists - top steptopstep.weebly.com/uploads/2/4/9/4/24947581/chapter05.pdf · 2...

Data Structures: A Pseudocode Approach with C , Second Edition 1

Chapter 5

Objectives

Upon completion you will be able to:

• Explain the design, use, and operation of a linear list

• Implement a linear list using a linked list structure

• Understand the operation of the linear list ADT

• Write application programs using the linear list ADT

• Design and implement different link-list structures

List

General Linear Lists

2

General linear lists

A general linear list is a list in which operations can be done anywhere in the list.

For simplicity, we refer to general linear lists as lists.

Data Structures: A Pseudocode Approach with C , Second Edition

3

5-1 Basic Operations

We begin with a discussion of the basic list operations. Each

operation is developed using before and after figures to show

the changes.

• Insertion

• Deletion

• Retrieval

• Traversal


4

insertion

Insertion is used to add a new element to the list


5

deletion

Deletion is used to remove an element from the list.


6

retrieval

Retrieval is used to get the information related to an element

without changing the structure of the list.


7

traversal

List traversal processes each element in a list in sequence.


8

Implementation


9

Data structure


10

Algorithms

Create list

Insert node

Delete node

List search

Retrieve node

Empty list

Full list

List count

Traverse list

Destroy list


11

Create list


12

Create list


13

Insert node

Only its logical predecessor is needed.

There are three steps to the insertion:

1. Allocate memory for the new node and move data to the node.

2. Point the new node to its successor.

3. Point the new node’s predecessor to the new node.


14

Insert node

Insert into empty list

Insert at beginning

Insert in middle

Insert at end


15

Insert into empty list


16

Insert at beginning


17

Insert in middle


Data Structures: A Pseudocode Approach with C 18

Insert at end

20

Delete node

Delete first node

General delete case


21

Delete first node



Delete general case

24

List search


25Data Structures: A Pseudocode Approach with C , Second Edition

28

Retrieve node


29

Empty list


30

Full list


31

List count


32

Traversal list


35

Destroy list


list general linear lists - top steptopstep.weebly.com/uploads/2/4/9/4/24947581/chapter05.pdf · 2...

Documents