Linked List - Implementation in C/C++

can we use calloc also for memory allocation ?????
i thing
if the created node is a last node then link will get NULL or '0' itself.

Thank you so much bro

This is a very clear explanation thanks a lot.

Would You like to provide Notes of this series ,please

@mohamedsalimelbazzi2576 Study this materials so you'll know what to teach ( outad ta3 le3bar )

this video is so useful, elaborate, thorough, and well explained that I use it just to brush up my memory of implementing a linked list in java lmao

I graduate from my good school institute of technology

its Monday 15 August 2022 give a chance I will be professional developer insha allah

any one help me to details expalin of linked list

1503354-27-1945

I recently discovered your videos. Many years ago I was a programmer with weak knowledge of data structures. Now, I've decided to gain a firm understanding of them. I've viewed several videos and am currently reading a book on the subject matter. You have managed to explain data structures so clearly that the seem so easy to understand. You are an outstanding teacher. Thanks for your videos.

Great Content

What a beautiful explanation ❤️❤️❤️❤️

if the condition in the while is that temp->next != NULL , when I print it doesn't print the first element as I'm first making temp = temp->next and if I print before that, it doesn't print the last one because it's null....

A NULL = ?

thanks for talking about new node and malloc coz i didn't know about the new node feature of c++

i love you brother

These videos are literally gold bars.

thanks you Sir . very helpful

I really felt in love with this channel the contents are very helpful before I hate this course in my college but for now I am really excited about thank a lot man for helping learners for free

watching in 2021

Animesh Sir, Dhanyavaad.

Thank god ,I found this channel

this series is a gem...respect u sir

excellent....

Finally cleared all my doubts. Thank you so much sir!!!!

hey is node* and * node the same?

class Node {
public:
int key;
int data;
Node* next;
Node() {
key = 0;
data = 0;
next = NULL;
}
Node(int k, int d) {
key = k;
data = d;
}
};
class SinglyLinkedList {
public:
Node* head;
SinglyLinkedList() {
head = NULL;
}
SinglyLinkedList(Node* n) {
head = n;
}
};

Chanel hotu aisa

I love this channel.

I tried to print data using while loop as you mentioned in the video at 12th minute my programme is printing all the elements in the linked list except first element?

you make hard topic too smooth..... Thanks Sir

everthing went over my head

I have a doubt. After traversing through the list ,the temp1 variable points at the last node as temp1->link == NULL .so writing temp1->link = temp
after the completion of the loop will make the link at the last node to be temp which isn't correct. Hoping to get some help on that

How can u be so good in teaching mate?

Suggestion after 8 year 🔥

thanks

This is amazing!!! My prof calls this "stopping at the end"

Love for humblefool lord harsha

Why..just why..cannot (ANY) university professor explain it as simply as this guy..thank you so much.. explaining coudnt be made simpler ugh, amazing dude, amazing

This was amazingly helpful. You are clearly gifted at teaching these sorts of subjects. Thank you so much for these videos.

this is 2021 ..but these videos are epic and unique...good videos sir

Bhai tu hi krwayega hamara aur in goron ka google mai placement