Linked Lists based on the original work of Dr. Roger deBry Version 1.0

Linked Listsbased on the original work of Dr. Roger deBry

Version 1.0

ObjectivesAt the conclusion of this lesson, students should be able to:

Describe the basic operation and structure of a linked list * Inserting into the list * Removing from the list * Iterating through the list

Write code that implements a singly linked list

Consider a shopping list that you want to keep onyour computer. To keep such a list you probably wanta data structure that

* is easy to keep in “some” order * is easy to insert items into the middle of * is easy to delete items from the middle of * is easy to iterate through * grows and shrinks as items are added and deleted

Motivation

What’s Wrong With an Array?ApplesBreadMilk

CarrotsHamburger

Add Chicken to the list

Chicken

CarrotsHamburger

Chicken

But I really want Chicken by Hamburger (both in the meat dept)

CarrotsHamburgerChicken

If there is a lot of stuff in the array, moving elementsto free up a space in the middle is expensive!

What’s Wrong With an Array?ApplesBreadMilkCarrotsHamburgerCorn

Remove milkfrom the list

What’s Wrong With an Array?ApplesBread

CarrotsHamburgerCorn

Can’t have “empty”slots in an array

What’s Wrong With an Array?ApplesBreadMilkCarrotsHamburgerCorn

Add popcornto the list

We need a data structure ...

That can grow and shrink as neededThat is not in contiguous memoryThat has fast insertion/deletion in the middle

A linked list is an ideal candidate!

headrolls

butter

this is called a node. Each node in thelist contains some data and a pointerto the next node. Nodes are dynamicallyallocated as new items are added tothe list.

Note that the pointer in thelast node in the list is set to null.

Adding a new item to the front of the grocery list!

headrolls24

butter1 lb

eggs1 dznull

1. Create a new node using the new operator

milk2 galsnull

newNode

nnnnnxxxxx

Node* newNode = new Node(“milk”, “2 gals”);

headrolls24

butter1 lb

eggs1 dznull

milk2 gals

newNode

2. copy the address stored in head into the pointer in the new node.

nnnnnnnnnn

headrolls24

butter1 lb

eggs1 dznull

milk2 gals

3. Store the address of the new node in the head.

newNodexxxxx

headrolls24

butter1 lb

eggs1 dznull

milk2 gals

3. Now we can throw away this pointer. Be careful, don’t write delete newNode;

newNodexxxxx

Adding a new item in the middle of the grocery list!

headrolls24

butter1 lb

eggs1 dznull

milk2 gals

1. Create another new node using the new operator

soda12 cans

newNode

headrolls24

butter1 lb

eggs1 dznull

milk2 gals

soda12 cans

newNode

2. Locate the node you want to insert after.

headrolls24

butter1 lb

eggs1 dznull

milk2 gals

soda12 cans

3. Store the pointer from this node in the new node.

newNode

headrolls24

butter1 lb

eggs1 dznull

milk2 gals

soda12 cans

4. Store the address of the new node in this node.

newNodexxxxxxxxxx

Delete an item from the front of the grocery list!

headrolls24

butter1 lb

eggs1 dznull

headrolls24

butter1 lb

eggs1 dznull

nnnnntemp

1. Get the pointer contained in the first node.

headrolls24

butter1 lb

eggs1 dznull

nnnnntemp

2. Store it in head.

xxxxxxxxxx

butter1 lb

eggs1 dznull

nnnnntemp

3. Delete the dynamically allocated node object.

rolls24

xxxxxxxxxx

Let’s Develop Some Code

The Node Class

- item: string- quantity: int- next: Node*

what are thedata members?

what are theoperations?

Node(:string, :int)setQuantity(:string) :voidgetQuantity( ) :stringsetItem(:string) :voidgetItem( ) :stringsetNext(:Node*) :voidgetNext( ) :Node*

The Head Class

- size: int- first: Node*

what are thedata members?

what are theoperations?

Head( )push_front(:Node*) :voiddelete_front(:Node*)insertNode(:Node*, Node*): void

Add a new item to the front of the list

first rolls

quantity

void Head::push_front ( Node* n ){ n->setNext(first); first = n;}

Delete an item from the front of the list

first rolls

quantity

void Head::delete_front ( ){ Node* byeByeNode = first; first = first->getNext( ); delete byeByeNode;}

quantity

Insert an item into the middle of the list

first rolls

quantity

void Head::insertNode ( Node* here, Node* newNode ){ Node* tempPtr = here->getNext( ); newNode->setNext(tempPtr); here->setNext(newNode);}

quantity

Lab Three: Design Your Linked List

Lab Three: Implement Your Linked List

Linked Lists based on the original work of Dr. Roger deBry Version 1.0

Documents

DUL Dulhunty, Roger Knyvett, 1925-2003 - eHive › accounts › 3977 › objects › ... · Correspondence, price lists, letting arrangements, sales brochure and plans for Berdella

Character Arrays Based on the original work by Dr. Roger deBry Version 1.0

LCDE043 - Peter Debry - Morir Es Un Error

Roger MyLink AC · 1 Roger MyLink 2 Roger MyLink Roger MyLink Roger MyLink 9 Roger MyLink Roger MyLink Roger MyLink Roger TMT T Roger Roger Roger MyLink Roger Roger MyLink Roger 10

WHITEPAPER - PCSCHEMATICminals lists, PLC lists, cables lists, labels, connections lists and tables of contents. These lists are updated automatically by the programme. Unit drawings

LCDE034 - Peter Debry - Jinetes Satanicos

Fostering innovation in STEM education, Maite Debry

DK150 by Roger...DK150 by Roger ... : : 9 :

Collection List no. A15 Roger Casement Papers lists/A015_Casement.pdf · National Library of Ireland . Collection List no. A15 . Roger Casement Papers (MS 13,073 – MS 13,092) (Accession

Αμφιφυλόφιλων Bisexual people Lists of lists

NASS Mail Lists Roger Beinhart International Programs Office August 24, 2006

2017 Memorial Day Updated Deceased Lists For WHS …files.constantcontact.com/58ea91f1401/266611a2-61f6-4a01-b42f-910f... · Bob Beck Doris Benson Roger Berdahl ... Freeman Vis Dorothy

· Web viewBy:LINDA DUFFY & NICHOLE WATT, DEPUTY CLERKS Council Member DeBry, Chair, presided. ... Alan Chenworth

7.5 Skip Lists - file7.5 Skip Lists -

1 Linked Lists (Lec 6). 2 Introduction Singly Linked Lists Circularly Linked Lists Doubly Linked Lists Multiply Linked Lists Applications

Roger Williams University | Roger Williams University

1 Lists A List ADT Types of Lists Lists in Java Collections API Using ordered lists – Tournament Maker Using indexed lists – Josephus Problem Implementing

Quepublishing.com Moving Access Tables to SharePoint 2010 or SharePoint Online Lists Presented by Roger Jennings quepublishing.com/jennings Based on: Chapter

Roger Harris Associates Hong Kong1. Dr. Roger W. Harris Roger Harris Associates Hong Kong harris38@netvigator.com Dr. Roger W. Harris

LCDE046 - Peter Debry - Mas Alla de Katmandú