Join Simon Allardice for an in-depth discussion in this video Using singly and doubly linked lists, part of Programming Foundations: Data Structures.
…We went from the generic idea of a…list, which just means an ordered sequence of elements,…into the slightly more specific idea of a…linked list being the way that it's typically implemented.…That the sequence is managed by each node having one link to the next node.…Now, this is a linked list.…But to be yet a little more specific, this is a called a…singly linked list, where we have a single link forward in each node.…But, we can also have a doubly linked list.…
The difference here would be one more piece of information for each node.…Instead of each node having a reference just to the next node, we add one…more piece of data that it also has a reference to the previous node as well.…Now to represent this visually can look a…little intimidating, because I'm showing the idea these objects…can be located anywhere that's convenient in memory,…they don't have to be next to each other.…But each object only has two extra pieces of data.…A reference to the next object and a reference to the previous object.…
So this is a doubly linked list, it allows us to…
Author
Simon Allardice
Released
6/10/2014Starting with simple ways of grouping data like arrays and structs, together you'll explore gradually more complex data structures, like dictionaries, sets, hash tables, queues and stacks, links and linked lists, and trees and graphs. Simon keeps the lessons grounded in the real world and answers the "why" behind many data-structuring decisions: Why use a hash table? Why is a set useful? Why avoid arrays? When you're finished with the course, you'll have a clear understanding of data structures and understand how to use them in whatever language you're programming in, today or 5 years from now.
- What is a data structure?
- Using C-style structs and arrays
- Sorting and searching arrays
- Working with singly and doubly linked lists
- Using stacks for last-in, first-out (LIFO) structures
- Using queues for first-in, first-out (FIFO) structures
- Working with hash tables
- Understanding binary search trees (BSTs)
- Learning about graphs
Skill Level Intermediate
Duration
Views
-
Introduction
-
Welcome1m 27s
-
What you should know2m 49s
-
-
1. Simple Structures and Basic Arrays
-
What is a data structure?4m 14s
-
Using C-style structs5m 57s
-
Basic arrays5m 58s
-
Multidimensional arrays6m 26s
-
-
2. Advanced Array Behavior
-
Sorting arrays3m 15s
-
Searching arrays4m 20s
-
Using binary searching4m 17s
-
3. Working with Lists
-
Introduction to lists2m 12s
-
-
4. Using Stacks and Queues
-
Priority queues and dequeues3m 35s
-
5. Hash-Based Data Structures
-
Using associative arrays5m 13s
-
Understanding hash functions4m 47s
-
Using hash tables4m 50s
-
Supporting hashing3m 22s
-
-
6. Sets, Trees, and Graphs
-
Using sets5m 28s
-
Introduction to graphs4m 47s
-
-
Conclusion
-
Review and conclusion5m 40s
-
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
Press 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: Using singly and doubly linked lists