Short introduction to linked lists in C

[@Moniaar_]

I literally spent the whole day trying to figure how this worked. Now i stumbled across your video and i understood everything in like 12 minutes. Thank you so much for simplifying such a complicated concept.

[@sagarbasnet6088]

Thank you so much. Best programming channel ever.I wish you were a professor in our college.

[@MahmutcanKaraman-wm6fb]

Been struggling in this subject for some time. You really helped me gain my confidence back thanks a lot for the well explained subject and much love.

[@mh-tw4kx]

Bruhh this channel is so underrated, you explain it so simple, not those complicated high level language bs, thank u so much

[@mohammedamin7130]

Best intro video that made me understand linked lists. watched a lot but none mixed code with explanation so quickly

[@درسدرس-س7غ]

Thank you so much sir! you explained it so well! I had a lot of problem with linked list and was giving up on it but now i'm excited! I'll start to watch the whole playlist :)

[@Hevletica]

My favourite KZbin channel at the moment. I subscribed with two channels!

[@makerofstartup7902]

I like your practical approach of programming memory(also -> vs . ), gave me few thoughts of putting it in spinning out cycle as dynamic link list. And free as demonstration is ok, but at the end of life, process with all its heaps(inside which are allocations) will be returned to os as free momory(if I remember right). Thank you.

[@n33to]

Sir, you are an excellent teacher. Thank you.

[@RaaZVan99]

So easy to follow and well explained Many thanks =)

[@grapejelly7]

thanks from Taiwan!! hope i had found this video before my midterm lol

[@longvunguyen6265]

OMG I love you so much !!! You just saved my life

[@Cat_Sterling]

Thank you for your great videos!

[@danielzir197]

Thanks bro, thanks to you i understood linked lists ; )

[@tassneemaltaf2001]

Very well explained.. Subscribed!

[@yassinex3144]

Thank you teacher . You are the best

[@towtruckn]

Thanks for the great video. Would I be right in saying that despite the fact a linked list is not an array; when memory is allocated with malloc() the reference to the next element on the heap would by default be contiguous if no other program is using that area of memory?

[@CodeVault]

Depends on how the operating system handles it but I can assure you it's not guaranteed. One reason would be memory fragmentation. Basically the whole address space is not made up of a contiguous block of allocated memory and then a contiguous block of unused memory, it has lots of gaps. Because of that, there are situations where the OS decides to allocate the next block of memory elsewhere rather than the next contiguous block since it would be more efficient.

[@towtruckn]

@@CodeVault Thanks for the reply; that makes a lot of sense especially given that in the past Windows had a problem with fragmentation. I don't know much about fragmentation on Linux but know that it is an issue. Thanks again.

[@ALEX00347]

all student 1337 loves you bro

[@imperatusmauser7096]

Mike Dane? He teaches millions of people? Never heard of him. Who needs Mike Dane when CodeVault exists?

[@QanarIsDelirious]

im still super confused what i have to take from this to work with in my first semester exams now ... like you start a node put a next to it ... but what can i do now :D will this be the full exam quest ,,, unclear what i shall prepare for actualy

[@CodeVault]

A linked list is just another way to store a set of data (an array for example). You know how you can quite simply add/remove/change elements in an array? Well, I assume, your teacher wants you to know how to do the same but with linked lists

[@QanarIsDelirious]

@@CodeVault build Most of the functions now ..the only Thing that i cant make Work is the free List function while all delete functions Work

[@QanarIsDelirious]

@@CodeVault i was kinda confused at First since i watched Like 5 Videos that Made step 1 of that linked list Thing and My brain didnt understand why i would Want a list of 2-3 Things with No usecase

[@theseangle]

​@@QanarIsDeliriousyou can use your linked lists to implement custom hashmaps! And then you can use those to write efficient code :)

[@aminekar8447]

this guy is a legend, W

[@codsnippet]

this man is damn genius

[@powerHungryMOSFET]

Subscribed. Loved it

[@brkycan]

hey man , *root.next.x=root.next->x those are equal things we said. but root is not a type of node * , it is type of node. how do this works? If it could be *(root.next).x , i would understand because (root.next) is a type of node * ;

[@CodeVault]

root.next->x is the same as *(root.next).x and definitely not *root.next.x The difference is that the first one dereferences root.next while the second one dereferences root.next.x (which is not a pointer as you said).

[@ananthkashyap3232]

Excellent video, great content.. Even some of the paid Udemy videos are not as good as this!

[@bushraw66]

can you please do a video about circular singly and doubly linked lists?

[@CodeVault]

Sure, I noted it down

[@Cat_Sterling]

What will happen if instead of "root.next = &elem2;" I will write "root.next = elem2;" ?

[@CodeVault]

You'll just get a compilation error since elem2 is of type Node but root.next is of type Node*

[@Cat_Sterling]

@@CodeVault Thank you!

[@burakburak5987]

typedef struct Node{ int x; struct Node* next; } isn't this a something recursive? i mean it's like an endless loop. becuase in struct there is a piece of its own. can someone please explain?

[@CodeVault]

It's not recursive. The size of the struct can be calculated at compile time since "int x" is (usually) 4 bytes and "struct Node* next" is (usually) 8 bytes. Because "next" is a pointer there's nothing recursive about it. Pointers in the whole program always have the same size. If you were to try to define "next" like so instead: "struct Node next" (without the *) you would get an error

[@burakburak5987]

@@CodeVault The point i struggled was that we use the struct (as a pointer) before compliting identifying the structure. Thanks for reply...

[@AtomAlexanderMunozNava]

Good content

[@keblinskiwastaken]

good videos!

[@Beastmodeyt23]

Lovely accent!

[@Etk333]

Ty

[@yuvalitzhak]

king!!

[@burakburak5987]

4:57 where is the link?

[@CodeVault]

Should be at the top. But here is the link nonetheless: code-vault.net/lesson/x8a6oj884e:1603733520791

[@burakburak5987]

@@CodeVault Thank you

[@botobeni]

instant sub

[@recepbayraktar6542]

Thank you!

[@ionguzun3952]

thanks bro...

[@riadhallouch]

this shit is tough :(

[@CodeVault]

Nothing worth learning is easy :/

[@cezzar5233]

💙

[@ibrahimbani1809]

thanks a lot