Iterating over a linked list in C

[nto]

Sir, you are an excellent teacher and I thank you for your hard work.

[anabrr]

You are incredible, I don't know what would I do without you. Thank you so much!!

[ayushmanpraxri]

Sir you're awesome thank you so much Makin these videos free you've cleared all of my doubts please keep making more data structures videos thanks again

[idomark]

bro gonna help me pass the next semester thank you sir

[unexxzzz]

Sir, You are a true legend thanks alot <3

[memenator]

I learned a lot from your videos, thank you so much :)

[abdulazizalramadan]

Man thank you very much iam struggling in my data structure subject and u helped me alot with this linked list videos

[ThatiMoreira]

Thanks a lot! Your videos are helping me so much!!!

[huseynadze]

Hello, is stopping the iteration with ==NULL always safe? can't we mark the last one with "tail pointer" while adjusting to our linked list, and then while iterating we can check if the the current is equal to "tail"?

[arunkumarsawant]

While works. But for prints the fist value 15 and comes out.

[alexneagoe]

I think this was very good, thank you for this, it was an instant subscribe!

I have a question.

could the loop that you have used for printing, be modified in order to be used to with free?

I could make the while loop work by swaping a temp value assigned with the next node with the current node value after free and using the current node !=NULL in the condition, but with for loop it wouldn't work, I would get funny valgrind errors (either would free the heap but with stack errors, or would memory leak the heap).

[arunkumarsawant]

Got 10 values of int from user in an array by scanf.
Called malloc 10 times. Stored pointers in array of pointers.
Assigned value and pointer next of struct nodes by dot operator.
Values array and pointer array deleted.
Every thing is on heap.
Is this ok.?

[PachucoDesigns]

Can you explain to me the difference between using arrow and using dot when referencing an attribute of a node? Because curr->x and curr.x seem to do the same thing.

[fadieid]

Thank you for this amazing explanation. Just wondering, shouldn't we cast the malloc(sizeof(Node)) into a pointer to Node? malloc return void* type and we are assigning it to Node*

[moneyDev]

thank you:) but do you know how to iterate elements in a vue recycler scroller

[mongraal]

but root should be on heap, not on stack