Please Comment, Subscribe and Click Bell🔔🔔🔔 Icon for More Updates. To learn software course from our experts please register here for online training: goo.gl/HIB0wL
Thank you so much sir... Today I missed my class on linked lists and you made it easier for me to get a clear view on everything and helped me in not sitting idle in the next class
I have almost watched all the C Programming vid many more, really it very good source to have better foundation in your programming concepts, Mr.Shrinivas has explained very clearly and logical but don't think about fluency of the English, It doesn't matter moreover, He is made viewers to understand very clearly, Thank You Sir & Naresh IT
A big fan of you Sir and will always be indebted to you; Just a small request Sir, The videos in the playlist are a bit disordered... Kindly arrange to get it correct... Thanks a lot Sir
thank you so much sir, im from bangladesh, and while doing link list got so many troubles to understand... ur method of teaching is beyond good, thankful to u sir, keep uploading videos... best wishes
Thanks a lot sir, since 6 ago I stacked in this concept. I have been studying for Some days then after I am not able to understand this concept. But today whole doubt to be clear regarding link list concept thanks sir your teaching style and your ways of understanding style are very fabulous....
Codewithhaary ka dekhne ke baad yhan pahucha...and you clear it in very simple way...love you sir..one problem please organised the playlist sequentially.
read the topic carefully it's clearly mentioned insertion of a node after a specified position.....which means if location is 3 the node will be added after 3rd position which is on the 4th position
very good sir ....I was frustrated and very confused .I was unable to understand linked list.Your vedio is of great help .have written all the programs to insert nodes in any specified position and display node .I will try it in my computer .Thanku sir
Sir plzz displays all algorithm in singly link list to insert first and last node and also the deleting node explains. Thank you 👌🙏🙏nice and easy way of solving a node at the position.
Here is the full executable program #include #include struct node { //Structure named node to store integer in variable data and a pointer variable which can store address location of next node int data; struct node *next; }*head; void insert(int data) { //This function will insert a new node to the start of the linked list struct node *temp = (struct node*)malloc(sizeof(struct node)); temp->data=data; temp->next=head; head=temp; } void add(int data) { struct node *temp,*p; int loc,len,i=1; printf("Enter the location"); scanf("%d",&loc); len=4; if(loc>len) { printf("Invalid location"); } else { p=head; while(inext; i++; } temp = (struct node*)malloc(sizeof(struct node)); temp->data=data; temp->next=p->next; p->next=temp; } } void display() { struct node *temp; temp=head; if(temp==NULL) { printf("The list is empty"); } else { while(temp!=NULL) { printf("%d->",temp->data); temp=temp->next; } } } int main() { insert(1); display(); insert(2); display(); insert(3); display(); add(6); display(); return 0; }
Hi sir! What if user enters 4 as a location since there are 4 nodes, I know for that append function could be used but what should be the systems response?
as the link for the last node is NULL so the p pointer wont be able to move further and the p->link location will be stored as NULL and the procedure will be the same as in the video showed.
