Savitch ch 13

Chapter 13 Pointers and Linked Lists

Overview ,[object Object],[object Object],Slide 13-

Nodes and Linked Lists ,[object Object],[object Object],[object Object],[object Object],Slide 13- 10 12 14 end head

Nodes ,[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.1

Implementing Nodes ,[object Object],[object Object],Slide 13- This circular definition is allowed in C++

The head of a List ,[object Object],[object Object],Slide 13-

Accessing Items in a Node ,[object Object],[object Object],[object Object],Slide 13-

The Arrow Operator ,[object Object],[object Object],[object Object],Slide 13- Display 13.2

NULL ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13-

To Use NULL ,[object Object],[object Object],Slide 13-

Linked Lists ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13-

Building a Linked List: The node definition ,[object Object],Slide 13-

Building a Linked List: Declaring Pointer Variable head ,[object Object],[object Object],Slide 13-

Building a Linked List: Creating the First Node ,[object Object],[object Object],Slide 13-

Building a Linked List: Initializing the Node ,[object Object],[object Object],Slide 13-

Function head_insert ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13-

Pseudocode for head_insert ,[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.3

Translating head_insert to C++ ,[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.4

An Empty List ,[object Object],[object Object],[object Object],[object Object],Slide 13-

Losing Nodes ,[object Object],[object Object],[object Object],Slide 13- Display 13.5

Memory Leaks ,[object Object],[object Object],[object Object],[object Object],Slide 13-

Searching a Linked List ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13-

Function search ,[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.6

Pseudocode for search ,[object Object],[object Object],[object Object],Slide 13-

Moving Through the List ,[object Object],[object Object],[object Object],[object Object],Slide 13-

A Refinement of search ,[object Object],Slide 13- Check for last node

Searching an Empty List ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.7

Pointers as Iterators ,[object Object],[object Object],[object Object],[object Object],Slide 13-

Iterator Example ,[object Object],Slide 13-

Inserting a Node Inside a List ,[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.8

Inserting the New Node ,[object Object],[object Object],[object Object],Slide 13-

Inserting the New Node ,[object Object],Slide 13- head after_me temp_ptr 2 2 3 2 7 2 9 0 5 2

Caution! ,[object Object],[object Object],[object Object],Slide 13- Display 13.9

Function insert Again ,[object Object],[object Object],[object Object],[object Object],Slide 13-

Removing a Node ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.10

Assignment With Pointers ,[object Object],[object Object],[object Object],Slide 13-

Variations on Linked Lists ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.11

Binary Tree ,[object Object],[object Object],[object Object],Slide 13- ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Display 13.12

Linked List of Classes ,[object Object],[object Object],[object Object],Slide 13- Display 13.13 Display 13.14 (1-2)

Program using the Node class ,[object Object],Slide 13- Display 13.15 (1-3)

Section 13.1 Conclusion ,[object Object],[object Object],[object Object],Slide 13-

A Linked List Application ,[object Object],[object Object],[object Object],Slide 13- Display 13.16

Program Example: A Stack Class ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.17

Using the stack Class ,[object Object],Slide 13- Display 13.18 (1-2)

Function push ,[object Object],[object Object],[object Object],[object Object],Slide 13-

Function pop ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 13-

Empty Stack ,[object Object],Slide 13-

The Copy Constructor ,[object Object],[object Object],[object Object],Slide 13-

The stack destructor ,[object Object],Slide 13-

stack Class Implementation ,[object Object],Slide 13- Display 13.19 (1) Display 13.19 (2)

A Queue ,[object Object],[object Object],[object Object],Slide 13- Display 13.20

Queue Class Implementation ,[object Object],[object Object],[object Object],[object Object],Slide 13- Display 13.21 (1-2) Display 13.22 (1-2) Display 13.23 (1-3)

Section 13.2 Conclusion ,[object Object],[object Object],[object Object],[object Object],Slide 13-

Savitch ch 13

Recommandé

Recommandé

Contenu connexe

Tendances

Tendances (20)

Similaire à Savitch ch 13

Similaire à Savitch ch 13 (20)

Plus de Terry Yoast

Plus de Terry Yoast (20)

Dernier

Dernier (20)

Savitch ch 13