Circular Linked List Tutorial - Why Use a Circular List?

This data structure tutorial focuses on the use of circular lists, especially circular linked lists. A circular structure allows for significant performance abilities and a very nice way to access both the front and end of the list. What is meant by a circular list is that the tail node does not point to null. Instead it points back to the head.
Playlist: • Queue Data Structure T...
◾◾◾◾◾
💻 Enroll in The Fundamentals of Programming w/ Python
tech-with-tim.....
📸 Instagram: / tech_with_tim
🌎 Website techwithtim.net
📱 Twitter: / techwithtimm
⭐ Discord: / discord
📝 LinkedIn: / tim-rusci. .
📂 GitHub: github.com/tec...
🔊 Podcast: anchor.fm/tech...
💵 One-Time Donations: www.paypal.com....
💰 Patreon: / techwithtim
◾◾◾◾◾◾
⚡ Please leave a LIKE and SUBSCRIBE for more content! ⚡
Tags:
- Tech With Tim
- Linked List
- Circular Linked List
- Circular List
- Circular List Tutorial
- Why use a circular list
#CircularList #DataStructures #LinkedList

[@longhotsummergames]

What is a practical application for this? And what is a good way to delete the first 3 items in a list?

[@alan7761]

Congrats on 60k subs.

[@TechWithTim]

Thank you !

[@dmitricherleto8234]

643k under two year. Impressive!

[@user-ou3bf2um3r]

You are amazing man, keep going

[@themonster4759]

thanks so much i hope you have nice next days

[@jamjam3448]

Thanks ☺️

[@SkyFly19853]

Circular Linked Lists... that sounds interesting...

[@jeanie8448]

I finally get it, thank you so much!!

[@nikosroom1913]

Great video, thank you!

[@Ralvy]

Where can i practice on this? I really need to solve many questions like this to be able to solve on my exam

[@keziakandii]

same.. everything I learn is 10x harder on a test.

[@Ralvy]

@@keziakandii True

[@frroossst4267]

leetcode?

[@Ralvy]

@@frroossst4267 too late, I passed the subject with a B. But thanks tho

[@LynnyrdRavage]

@@Ralvy Do you remember if this helped? Or where I could learn to practice this?

[@nagusameta366]

I don't get how the tail.next actually gets to point back to the first node in the list when there's already no ref variable that keeps track of what the first node is.... Could someone explain

[@viktorstefanov4848]

If there are no elements in the ll the first added one will be the tail, the second will be the head, so you dont really need to store the head's location as it will always be the 1st element appended to a list. You could achieve that with some simple if statements. Append 6 now 6 is the tail now append 10 and 10 is the tail pointing to 6 and vice versa, now append 2 and 2.next is 6.next and 6.next is 2. Hope this clears things up

[@generalhimeko2639]

you've explain how its useful for real world application but update your video please.....i couldnt see the syntactically indentation scope.

[@mitpatel4898]

why is the code for adding at the end and front the same thing? how can you then tell which is which?

[@mhb12x80]

Because it's literally the same thing (adding an element is practically the same) To conclude : saying the word beginning or end is pointless

[@fiendsgaming7589]

Are you in the first year? Because this was just taught to me week ago and I'm in 2nd semester first year

[@TechWithTim]

Going into second

[@mhb12x80]

Has anyone realized that adding at the beginning and the end is litey the same thing ?

[@technoinfoworldwide2329]

for your easy,why not to buy one small whiteboard,marker..it would be easy for you to explain..