Presentation is loading. Please wait.

Presentation is loading. Please wait.

Linked Lists.

Published byΧλόη Κοντόσταυλος Modified over 5 years ago

Similar presentations

Presentation on theme: "Linked Lists."— Presentation transcript:

1 Linked Lists

2 Linked List Linked List : List implemented with Nodes connected by pointers

3 Node Node: Stores one item of data Stores a pointer to another node

4 Node Use Linked List Nodes: Nodes created on heap, tracked w/pointer

5 Nodes, New & Pointers new requires a pointer to store address

6 Nodes, New & Pointers new requires a pointer to store address
Not every pointer requires new memory

7 Node Connections Connect by setting next ptr…

8 Node Connections Connect by setting next ptr…

9 Node Connections Can reach anything from first Node:

10 Building a List Building list at head:

11 Linked List Temp tracks old head…

12 Linked List Temp becomes new head

13 Linked List Add another node:

14 Linked List Iteration Need pointer to track our position in list:

15 Linked List Iteration Start traversal at head:

16 Linked List Iteration Advance with current = current->next

17 Linked List Iteration Advance with current = current->next

18 Linked List Iteration Advance with current = current->next

19 Linked List Iteration Stop when current = nullptr

20 Linked List Iteration Do work using current->element

21 Tails How do we add something to the end of the list?

22 Tails How do we add something to the end of the list?

23 Linked List Tail Tail pointer tracks last node:

24 Linked List Tail Add to head unchanged…

25 Linked List Tail Add to head unchanged…

26 Linked List Tail Can insert after tail:

27 Linked List Tail Can insert after tail:

28 Linked List Tail New node becomes the new tail

Download ppt "Linked Lists."

Similar presentations

Singly linked lists Doubly linked lists

Singly linked lists Doubly linked lists
Linked List: Traversal Insertion Deletion. Linked List Traversal LB.

Linked List: Traversal Insertion Deletion. Linked List Traversal LB.
Chapter 5 introduces the often- used data structure of linked lists. This presentation shows how to implement the most common operations on linked lists.

Chapter 5 introduces the often- used data structure of linked lists. This presentation shows how to implement the most common operations on linked lists.
Stacks, Queues, and Linked Lists

Stacks, Queues, and Linked Lists
Linked List 1. Introduction to Linked List 2. Node Class 3. Linked List 4. The Bag Class with Linked List.

Linked List 1. Introduction to Linked List 2. Node Class 3. Linked List 4. The Bag Class with Linked List.
Data Structure Lecture-5

Data Structure Lecture-5
Data Structure Lecture-3 Prepared by: Shipra Shukla Assistant Professor Kaziranga University.

Data Structure Lecture-3 Prepared by: Shipra Shukla Assistant Professor Kaziranga University.
Analysis of programs with pointers. Simple example What are the dependences in this program? Problem: just looking at variable names will not give you.

Analysis of programs with pointers. Simple example What are the dependences in this program? Problem: just looking at variable names will not give you.
Chapter 17 Linked List Saurav Karmakar Spring 2007.

Chapter 17 Linked List Saurav Karmakar Spring 2007.
Data Structures: A Pseudocode Approach with C

Data Structures: A Pseudocode Approach with C
Linked Lists Compiled by Dr. Mohammad Alhawarat CHAPTER 04.

Linked Lists Compiled by Dr. Mohammad Alhawarat CHAPTER 04.
Queue using an array. .head.tail Pointers head and tail always point to the first empty slot before or after elements in the list. Thus, initially they.

Queue using an array. .head.tail Pointers head and tail always point to the first empty slot before or after elements in the list. Thus, initially they.
Linked Lists. Example We would like to keep a list of inventory records – but only as many as we need An array is a fixed size Instead – use a linked.

Linked Lists. Example We would like to keep a list of inventory records – but only as many as we need An array is a fixed size Instead – use a linked.
Insertion into a B+ Tree Null Tree Ptr Data Pointer * Tree Node Ptr After Adding 8 and then 5… 85 Insert 1 : causes overflow – add a new level * 5 * 158.

Insertion into a B+ Tree Null Tree Ptr Data Pointer * Tree Node Ptr After Adding 8 and then 5… 85 Insert 1 : causes overflow – add a new level * 5 * 158.
Variations of Linked Lists CS 308 – Data Structures.

Variations of Linked Lists CS 308 – Data Structures.
1 Stack Data : a collection of homogeneous elements arranged in a sequence. Only the first element may be accessed Main Operations: Push : insert an element.

1 Stack Data : a collection of homogeneous elements arranged in a sequence. Only the first element may be accessed Main Operations: Push : insert an element.
1 Chapter 16-1 Linked Structures Dale/Weems. 2 Chapter 16 Topics l Meaning of a Linked List l Meaning of a Dynamic Linked List l Traversal, Insertion.

1 Chapter 16-1 Linked Structures Dale/Weems. 2 Chapter 16 Topics l Meaning of a Linked List l Meaning of a Dynamic Linked List l Traversal, Insertion.
Lists 1. Introduction Data: A finite sequence of data items. Operations: Construction: Create an empty list Empty: Check if list is empty Insert: Add.

Lists 1. Introduction Data: A finite sequence of data items. Operations: Construction: Create an empty list Empty: Check if list is empty Insert: Add.
CSS446 Spring 2014 Nan Wang  Java Collection Framework ◦ LinkedList ◦ Set ◦ Map 2.

CSS446 Spring 2014 Nan Wang  Java Collection Framework ◦ LinkedList ◦ Set ◦ Map 2.
C++ Programming: From Problem Analysis to Program Design, Second Edition Chapter 17: Linked Lists.

C++ Programming: From Problem Analysis to Program Design, Second Edition Chapter 17: Linked Lists.

Similar presentations

Ads by Google