GOOD MORNING SIR , Your videos very nice and easy understand sir, every day i must see u videos your explanation is too good and your programming code easy to understand to others once again very nice sir i am your fan sir
Sir insertion in specific position of single linked list =insertion in specific position of circular linked list....bez ,both cases not change head or tail... correct r not...?
Sir, your explanation is just stand out !!! one more thing i notice in your lecture you are sweating a lot. Isn't there any stuff to keep you cool. You put a lot of effort to create these videos under this circumstances.just hat off!!!
Hi. For insertion at the beginning, instead of tail->next=new; head=new; can we write head=new; tail->next=new; I have a similar question for insertion at the end also.
Sir please sir c++ me poora ka poora code kese likenge aesi video bna do please sir🙏🙏mujhe code likhne me bhot dikkat hoti h sir c++ me....please sir provide me the videos of how to write code for these linked list in c++ code🙏🙏
I WANT A HELP FROM U I WROTE A C PROGRAM FOR SINGLY LINKED LIST BUT THE WHEN THE DELETE BLCCK UNDER THE SWITCH STATEMENT EXECUTED THEN WHOLE PROCESS IS EXITED PLEEASE SEND ME YOUR MAIN THEN I SENT THE CODE TO U
The difference between sll and dll on the basis of traversal is that in sll we can only traverse in forward direction whereas in dll we can traverse in both forward and backward direction.
#include #include struct node{ int data; struct node*next; }*head,*tail; void creation() { int n; printf("Enter the Size= "); scanf("%d", &n); int i = 1; while (i data = value; newnode->next = NULL; if (head == NULL) { head = newnode; tail = newnode; } else { tail->next = newnode; tail = newnode; tail->next=head; } i++; } } void insertAtfist(){ int value; printf("Enter the value DO!you insert= "); scanf("%d",&value); struct node*newnode; newnode=(struct node*)malloc(sizeof(struct node)); newnode->data=value; newnode->next=head; tail->next=newnode; head=newnode; } void insertAtlast(){ int value; printf("Enter the value DO!you insert= "); scanf("%d",&value); struct node*newnode; newnode=(struct node*)malloc(sizeof(struct node)); newnode->data=value; tail->next=newnode; newnode->next=head; tail=newnode; } void specific(){ int n; int i=1; printf("Enter the position= "); scanf("%d",&n); struct node*ptr=head; while(inext; i++; } int value; printf("Enter the value= "); scanf("%d",&value); struct node*newnode; newnode=(struct node*)malloc(sizeof(struct node)); newnode->data=value; newnode->next=ptr->next; ptr->next=newnode; } void deleteAtfirst(){ struct node *temp; temp=head; head=head->next; tail->next=head; free(temp); } void delleteAtlast(){ struct node*temp; temp=head; while(temp->next!=tail){ temp=temp->next; } tail->next=NULL; temp->next=head; tail=temp; } void travase(){ struct node *temp=head; while(temp->next!=head){ printf("%d->",temp->data); temp=temp->next; } printf("%d->",temp->data); } void deleteSpecficPosition(){ int n; int i=1; struct node*temp,*newnode; temp=head; printf("Enter the positon = "); scanf("%d",&n); while(inext; i++; } temp->next=temp->next->next; } int main(){ creation(); //insertAtfist(); //insertAtlast(); // specific(); //travase(); //deleteAtfirst(); // delleteAtlast(); //deleteSpecficPosition();
travase();
} As a newcomer, it's completely normal to encounter numerous errors during your initial attempt (sending love from Bangladesh). Making mistakes is an integral part of the learning process, and it's how we grow and improve. Embrace these challenges as opportunities for growth and don't hesitate to seek help or explore different approaches. Remember, everyone starts somewhere, and with practice, you'll gain confidence and proficiency in no time. Love and support from Bangladesh! 😊
![I.N "HALLUCINATION" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/n5B5q1Hwt_U/mqdefault.jpg)
Sir I might have visited almost every possible RUclips tutorial on CLL.... But none were as helpful and understandable as yours. I'm a lot thankful!!!
GOOD MORNING SIR , Your videos very nice and easy understand sir, every day i must see u videos your explanation is too good and your programming code easy to understand to others
once again very nice sir
i am your fan sir
ir your explanation is too good...tq for uploading
Linked lists is so easy now after seeing your videos..tq so much sir (FROM->BANGLADESH)
Sir your explanation is too good...tq for uploading
Linked lists is so easy now after seeing your videos..tq so much sir
Jst osm sir, thanku for such efforts 🙏🙏, no video is as useful as yours
Sir your teaching is really good you will make us really understand
You are great sir 👍
Your explanation is too easy to understand 😍😍
Thanking you 😇
he's so much hardworking , thank you so much for such grat explaination
God of programming!🙏
Best explaination on RUclips
But less views🙁
Fantastic video
Nice clear explanation Sir
Really sir it just amazing, thank you soo much sir for this amazing video.
your explanation method is good and understanding
Hello SIr,
Thank you ......so much sir .....for providing this videos.
Great sir it was an excellent session💗
Nice lecture sir....this is really helpful..sir please upload more topics on data structures..tree, queues
Sir insertion in specific position of single linked list =insertion in specific position of circular linked list....bez ,both cases not change head or tail... correct r not...?
Hats off 👏sir for all ur efforts.👌👌
Very helpful video ❤
Sir, your explanation is just stand out !!! one more thing i notice in your lecture you are sweating a lot. Isn't there any stuff to keep you cool. You put a lot of effort to create these videos under this circumstances.just hat off!!!
🤩🤩🤩✨✨✨✨
Your explanation is superb.....
Awesome video sir🙏🙏
Thank you very much sir.🙏🙏🙏
Sir how did system know that head and tail are starting and ending nodes?
Its inbuilt in complier...
Hope it helped^_^
by using header files it assigns
Best explanation sir.Thank you sir.
Hi.
For insertion at the beginning, instead of
tail->next=new;
head=new;
can we write
head=new;
tail->next=new;
I have a similar question for insertion at the end also.
Yes we can write in both ways
yes we can write
but it will be:
head=new;
tail->next=head;
You are great, sir!
nice explanation sir thnkuu
Wow wow wow wow wow sir best best best best
I understood very much sir thank you sir
Can i use tail in my final exam cause any one of my teacher haven't use tail before in any algorithm.
your explanation is very good sir, can u let me know the time complexity for all this three operations.
THANKYOU!
Nice lecture sir
sir if we put pos=1 but the answer is not coming sir so plz tell the logic behind it sir
Sir either we don't have any head and tail then how we do that sir !!!
Nice explanation Sir
Sir how to traverse the tail pointer to the end of the list
@@abhijeetgorai242 yes your traverse the both head and tail also
just nailed it
❤❤❤❤
insertion at end can i write
new->data=value
new->next=tail
tail->next=new
tail=new
Sir it consist of single and double know
great sir
sir ,when im trying to display the list its printing a number in an infinite loop,not printing the list...what have i done wrong can you plse tell me
For()
{
temp=temp->next
}
Then new->data=value;
......
Sir please sir c++ me poora ka poora code kese likenge aesi video bna do please sir🙏🙏mujhe code likhne me bhot dikkat hoti h sir c++ me....please sir provide me the videos of how to write code for these linked list in c++ code🙏🙏
😍
Sir can you explain the ADT of this circular linked list
super sir
Sir please explain circular queue implementation by using dynamic arrays
Sir plz share a video of double circular linked list
I WANT A HELP FROM U
I WROTE A C PROGRAM FOR SINGLY LINKED LIST BUT THE WHEN THE DELETE BLCCK UNDER THE SWITCH STATEMENT EXECUTED THEN WHOLE PROCESS IS EXITED
PLEEASE SEND ME YOUR MAIN THEN I SENT THE CODE TO U
This is using java or c?
C
what is the differance between circular and singly linked list
The difference between sll and dll on the basis of traversal is that in sll we can only traverse in forward direction whereas in dll we can traverse in both forward and backward direction.
sir how to do without the names head and tail...
hi
sorry didnt get you
@@sundeepsaradhi hi sir, u told head pointing to first and tail to the last. But how to do by taking only one pointer like struct node **p.
Sir can u please explain programs for labs
what if we insert in position=1;what will be the output
Kya yaar sir
Sir why this loop
Which loop are you talking about?
Sir please execute the same program........
#include
#include
struct node{
int data;
struct node*next;
}*head,*tail;
void creation() {
int n;
printf("Enter the Size= ");
scanf("%d", &n);
int i = 1;
while (i data = value;
newnode->next = NULL;
if (head == NULL) {
head = newnode;
tail = newnode;
} else {
tail->next = newnode;
tail = newnode;
tail->next=head;
}
i++;
}
}
void insertAtfist(){
int value;
printf("Enter the value DO!you insert= ");
scanf("%d",&value);
struct node*newnode;
newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=value;
newnode->next=head;
tail->next=newnode;
head=newnode;
}
void insertAtlast(){
int value;
printf("Enter the value DO!you insert= ");
scanf("%d",&value);
struct node*newnode;
newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=value;
tail->next=newnode;
newnode->next=head;
tail=newnode;
}
void specific(){
int n;
int i=1;
printf("Enter the position= ");
scanf("%d",&n);
struct node*ptr=head;
while(inext;
i++;
}
int value;
printf("Enter the value= ");
scanf("%d",&value);
struct node*newnode;
newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=value;
newnode->next=ptr->next;
ptr->next=newnode;
}
void deleteAtfirst(){
struct node *temp;
temp=head;
head=head->next;
tail->next=head;
free(temp);
}
void delleteAtlast(){
struct node*temp;
temp=head;
while(temp->next!=tail){
temp=temp->next;
}
tail->next=NULL;
temp->next=head;
tail=temp;
}
void travase(){
struct node *temp=head;
while(temp->next!=head){
printf("%d->",temp->data);
temp=temp->next;
}
printf("%d->",temp->data);
}
void deleteSpecficPosition(){
int n;
int i=1;
struct node*temp,*newnode;
temp=head;
printf("Enter the positon = ");
scanf("%d",&n);
while(inext;
i++;
}
temp->next=temp->next->next;
}
int main(){
creation();
//insertAtfist();
//insertAtlast();
// specific();
//travase();
//deleteAtfirst();
// delleteAtlast();
//deleteSpecficPosition();
travase();
}
As a newcomer, it's completely normal to encounter numerous errors during your initial attempt (sending love from Bangladesh). Making mistakes is an integral part of the learning process, and it's how we grow and improve. Embrace these challenges as opportunities for growth and don't hesitate to seek help or explore different approaches. Remember, everyone starts somewhere, and with practice, you'll gain confidence and proficiency in no time. Love and support from Bangladesh! 😊