C++ Circular Lists, Sentinel Nodes, Merging Lists
Channel:
Subscribers:
2,650
Published on ● Video Link: https://www.youtube.com/watch?v=tpq5_l1g_kg
0What if head's previous pointer and tail's next pointer didn't actually point to null?
We cover three possibilities here:
1) Link them together and form a circular linked list
2) Add a sentinel node on each side and use it for iterators and ranged-based for loops
3) Merge two lists together with them
Other Videos By Bill Kerney
| 2024-03-15 | UNIX / Vim Quiz #2 |
| 2024-03-11 | Black Box BST Debugging / BST Delete Algorithm |
| 2024-03-08 | Quiz Time: UNIX and Vim |
| 2024-03-06 | C++: BST print, insert, and invariants |
| 2024-03-04 | Conceptual overview of Binary Search Trees |
| 2024-03-04 | C++: Templated Stacks and Queues |
| 2024-03-02 | Queues and Stacks |
| 2024-03-02 | C++: Debugging Linker Errors |
| 2024-02-28 | C++: Dynamic Cast |
| 2024-02-28 | CSCI 1: Fallacies and Midterm I Review |
| 2024-02-26 | C++ Circular Lists, Sentinel Nodes, Merging Lists |
| 2024-02-26 | C++: Keywords You Might Not Know |
| 2024-02-23 | C++ Inheritance |
| 2024-02-21 | C++ Smart Pointers |
| 2024-02-14 | C++: Inserting into a Linked List |
| 2024-02-12 | C++: Debugging Linked Lists using Invariants |
| 2024-02-09 | Lab Time: Make a Makefile |
| 2024-02-07 | C++ Linked Lists |
| 2024-02-05 | C++: Operators and Type Conversion with Constructors |
| 2024-02-03 | C++ Test Driven Development using Gtest |
| 2024-02-03 | Managing Computer Science Projects is Hard |