Join Joe Marini for an in-depth discussion in this video Linked lists, part of Programming Foundations: Algorithms.
- [Instructor] The next data structure…that we're going to examine is the linked list.…A linked list is a linear collection of data elements…which are sometimes called nodes.…So this is sort of like an array,…but a little bit different.…Each of these nodes have a field…that points to the next element in the list.…And each of these elements can contain…whatever information your app needs to work with.…So conceptually, a linked list looks like this…and in this case, the nodes contain integer numbers…as their data.…
The first item in the list is called the head.…And each element has a field…that refers to the next item in the list.…The last item in the list has a field…that points to nothing,…which indicates that it is the end of the list.…In this particular case,…the diagram you see here represents…what's called a singly-linked list.…It's called that because there's only one direction…of links provided,…that is, each item only knows about its next neighbor.…But there's no reason we couldn't have a doubly linked list,…
Author
Released
11/8/2018- Measuring algorithm performance
- Working with data structures such as arrays, stacks, and queues
- Looping and recursion
- Sorting data
- Searching data
- Filtering and value counting with hash tables
Skill Level Beginner
Duration
Views
-
Introduction
-
What you should know1m 35s
-
1. Overview
-
What are algorithms?2m 44s
-
-
2. Common Data Structures
-
Arrays2m 29s
-
Linked lists2m 36s
-
Linked lists walkthrough7m 35s
-
Stacks and queues2m 43s
-
Hash tables7m 59s
-
3. Recursion
-
Understanding recursion3m 38s
-
Simple recursion example3m 9s
-
Power and factorial4m 14s
-
-
4. Sorting Data
-
Overview of sorting2m 4s
-
The bubble sort5m 8s
-
The merge sort2m 24s
-
Implement the merge sort5m 10s
-
The quicksort3m 31s
-
Implement the quicksort5m 39s
-
-
5. Searching Data
-
Unordered list search3m 45s
-
Ordered list search5m 30s
-
-
6. Other Algorithms
-
Find max value recursively3m 44s
-
Conclusion
-
Next steps1m 18s
-
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
CancelTake notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.
Share this video
Embed this video
Video: Linked lists