Lecture Outline

• A circular linked list is a linked list, but the head and tail node are connected
• Going from the Doubly Linked List to a Circular Linked List is not much, we just need to remember to reattach the head and tail node after inserting or removing a node.
• We use a do/while loop to print out elements in a CLL

Lecture Recording

• https://montana.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=18c6543d-0baf-420e-9540-b1f8015d2909

Lecture Slides

• Circular Linked Lists

Code

• MusicPlayer.java
• beethoven1.wav

Click here to return to the course schedule