Singly Linked Lists Tutorial - What is a Linked List?

What is a linked list? This singly linked list tutorial will cover all of the important features of linked lists like: time complexity, implementation with pseudo code, pros, cons and more. After this data structure tutorial you should have a solid idea of how singly linked lists work and feel comfortable using and implementing them in your own code.
Playlist: • Queue Data Structure T...
◾◾◾◾◾
💻 Enroll in The Fundamentals of Programming w/ Python
tech-with-tim.teachable.com/p...
📸 Instagram: / tech_with_tim
🌎 Website techwithtim.net
📱 Twitter: / techwithtimm
⭐ Discord: / discord
📝 LinkedIn: / tim-rusci. .
📂 GitHub: github.com/techwithtim
🔊 Podcast: anchor.fm/tech-with-tim
💵 One-Time Donations: www.paypal.com/donate/?token=...
💰 Patreon: / techwithtim
◾◾◾◾◾◾
⚡ Please leave a LIKE and SUBSCRIBE for more content! ⚡
Tags:
- Tech With Tim
- Singly Linked List
- Single Linked List Tutorial
- Linked Lists
- Data Structures Tutorial
- Singly Linked List Data Structure
#LinkedList #DataStructures #ComputerScience

[@emalda99]

After watching your tutorials, no other tutorial comes any close to yours. You're amazing!

[@maryamkameshki542]

6:28 - find a value in the SLL method, 9:50 - add something to the beginning of the list, 11:10 - find and remove a node sheesh u explained it better than our data structure instructor 😂 great job! continue 👍💕

[@niquebon]

Thanks so much for explaining Singly Linked List very simply. Watched a lot of vids about Linked Lists and still couldn't understand it 100% but I can finally understand it now!!

[@sylvesterdzimiri3266]

I love watching ur videos man

[@proddima]

thanks man that was very helpful, good explanation

[@namescoby3997]

thanks this is really helping me to understand the traverse

[@generalhimeko2639]

this video is so good

[@shrinathjoshi704]

which software are you using for presentation ?

[@jayvondied5385]

u just saved me like 10 bands thanks

[@KevinTempelx]

Thanks!

[@themonster4759]

thanks that's helpful episode

[@sainco3036]

thanks.

[@MagnusAnand]

Best drawing skills!

[@TechWithTim]

;)

[@amongdoomers9464]

🤣🤣

[@sohadmad1823]

U're awesome

[@aryanbhatia6992]

Please complete the PyQt5 series a.......

[@Sergey_Latyshev]

12:30 - but -3 is still in the memory. Memory leak!

[@TechWithTim]

Most languages automatically clean memory when all pointers to an object are deleted. For example, java does this automatically

[@Sergey_Latyshev]

Sure, but not all of them. C and C++ are still among the most popular languages.

[@adarshsingh764]

@@Sergey_Latyshev i love c and c++ but these are annoying sometimes

[@Sergey_Latyshev]

@@adarshsingh764 I agree, but I believe it helps to understand better what a program is doing. Anyway, it doesn't hurt to write 'free (something);' when it is necessary.

[@SkyFly19853]

Can it be used for Python or Ruby?

[@carlosguerrero7381]

yes, any language you want to learn data structure.

[@SkyFly19853]

@@carlosguerrero7381 I understand. Could you give me an example?

[@carlosguerrero7381]

@@SkyFly19853 Important thing: you can pick either python or ruby in your comfortable writing. Feel free to check the link: www.rubyguides.com/2017/08/ruby-linked-list/ www.tutorialspoint.com/python/python_linked_lists

[@SkyFly19853]

@@carlosguerrero7381 Sure, I check it out. Thank you very much for the link. 💯💯💯💯

[@SkyFly19853]

@COOLBIAN57 I see what you mean... I am a visual learner, so, I wanted to see a solid example or code about it.

[@longhotsummergames]

Why is adding to the end of the list faster than an array?

[@EntrepreneurAffiliate]

I'm assuming you mean why it's slower than an array. If that's what you mean its because you have to go through all of the linked list to get to the last element so the time complexity is o(n) but in an array all you need to do is append a value so its o(1). Linked lists are slower than an array when adding values at the end.

[@Saotsu1]

@@EntrepreneurAffiliate It's not slower, you can add to the last with O(1), all you need to do is create an attribute called tail in the linked list and store the last node in it whenever you add a new node

[@scullyy]

why current = self.head. Why not operate on self.head? I have an idea why, but i'm a bit miffed at tutorials just not explaining why they do something.

[@argghsgahghrw]

dude you need to be a professor