Data Structure

General linear lists 5-1 Basic Operations

 A general linear list is a list in which We begin with a discussion of the basic list operations. Each
operation is developed using before and after figures to show the
operations can be done anywhere in the changes.
list.
 For simplicity, we refer to general linear • Insertion
lists as lists. • Deletion
• Retrieval
• Traversal

Data Structures: A Pseudocode Approach with C 1 Data Structures: A Pseudocode Approach with C 2

insertion deletion

Insertion is used to add a new element to the list Deletion is used to remove an element from the list.

Data Structures: A Pseudocode Approach with C 3 Data Structures: A Pseudocode Approach with C 4

retrieval traversal

 List traversal processes each element in a

list in sequence.

Retrieval is used to get the information related to an element

without changing the structure of the list.
Data Structures: A Pseudocode Approach with C 5 Data Structures: A Pseudocode Approach with C 6

1
Data Structure

Implementation Data structure

Data Structures: A Pseudocode Approach with C 7 Data Structures: A Pseudocode Approach with C 8

Algorithms Create list

 Create list  Empty list

 Insert node  Full list
 Delete node  List count
 List search  Traverse list
 Retrieve node  Destroy list

Data Structures: A Pseudocode Approach with C 9 Data Structures: A Pseudocode Approach with C 10

Create list 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.

Data Structures: A Pseudocode Approach with C 11 Data Structures: A Pseudocode Approach with C 12

2
Data Structure

Insert node Insert into empty list

 Insert into empty list

 Insert at beginning
 Insert in middle
 Insert at end

Data Structures: A Pseudocode Approach with C 13 Data Structures: A Pseudocode Approach with C 14

Insert at beginning Insert in middle

Data Structures: A Pseudocode Approach with C 15 Data Structures: A Pseudocode Approach with C 16

Insert at end

Data Structures: A Pseudocode Approach with C 17 Data Structures: A Pseudocode Approach with C 18

3
Data Structure

Delete node Delete first node

 Delete first node

 General delete case

Data Structures: A Pseudocode Approach with C 19 Data Structures: A Pseudocode Approach with C 20

Delete general case

Data Structures: A Pseudocode Approach with C 21 Data Structures: A Pseudocode Approach with C 22

List search

Data Structures: A Pseudocode Approach with C 23 Data Structures: A Pseudocode Approach with C 24

4
Data Structure

Data Structures: A Pseudocode Approach with C 25 Data Structures: A Pseudocode Approach with C 26

Retrieve node Empty list

Data Structures: A Pseudocode Approach with C 27 Data Structures: A Pseudocode Approach with C 28

Full list List count

Data Structures: A Pseudocode Approach with C 29 Data Structures: A Pseudocode Approach with C 30

5
Data Structure

Traversal list

Data Structures: A Pseudocode Approach with C 31 Data Structures: A Pseudocode Approach with C 32

Destroy list

Data Structures: A Pseudocode Approach with C 33 Data Structures: A Pseudocode Approach with C 34