Very helpful video sir...You teach us very well...❤❤Blessed to have a teacher like you...You made my subjects very easy because I can easily learn from your tutorials...Thanks a lot sir ...🙏🙏🙏Keep making videos regularly for us...😃😃😃😊😊😊😊😊😊😊😊😊😊😊
Sir i never studied any programming subject ,so i want to know that u are written a small program in right corner ,will be use in every program .in starting
Pls clarify my doubt.....I'm really getting confused....while equating one term to other.....like head=temp.....and....temp=head.....please let me know techique to move in a processed way
sir how head is null at starting , it is pointer variable and it will hold some address(some garbage value) when it is declared so how we are checking head==NULL
the pointer is only there to point to the location where a node exists. If that pointer is not pointing to anything, it will be null. It is a Node pointer (struct pointer) and therefore, if no nodes were instantiated and placed in heap, then head obviously cannot be assigned to anything either.
@@Priyanka-oc1lk no it's not same head->next means adress part of head is null.head== null means adress of head is null.it is different.run code on compiler
while assigning the else condition i.e tail->next=new; we can also use head->next=new; as for the value 10 head n tail r same so can u use head instead of tail ?
head will be pointing to the 1st node,while tail will be used to traverse last node and establish the connection btw 1st node and last node..so he has taken tail-->next=new
#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! 😊
Sir aap bhut hi acha explain krte hai.those person how like the way of explanation plz press one thumb here👍
Sir you have explained Data structure from all others in you tube . Keep up the good work!!!
Thank you.
Your way of teaching is totally understoodable
Happy teacher's dayy uh r a life saviour for us
Thank you
Very helpful video sir...You teach us very well...❤❤Blessed to have a teacher like you...You made my subjects very easy because I can easily learn from your tutorials...Thanks a lot sir ...🙏🙏🙏Keep making videos regularly for us...😃😃😃😊😊😊😊😊😊😊😊😊😊😊
Sir ,please do upload videos of tress and graphs..
Thanks so much sir,, your teaching is so helpful to me and I can able to understand easily the data structure topic, u r great sir ,,
ur way of teaching is really best among all 😯sir👌👌👈
Tq u sir..... Way of xplanation is perfect... Easy to understand.
Sir I love d way teach....thanx for d help.....hope ur channel will get million of subscribers.....thank u sir
sir firstly thankyou for explaining such wonderfully. secondly, sir while(ch=='N") hona chahiye according to code.
Clear cut explanation!!thank you so much sir🙏
love ur explanation. THANK U SIR
Sir ur classes are veryusefull
sir first time I am finding data structure very easy .
Nice explanation sir..thank u and all the best..!👏
sir please continue DSA in python series.It's a humble request to you.
U r great sir.... Thanks for all the lessons
You are the best Sir . Thank You 🙏
Thank you so much. Very clear explaination given
Sir i never studied any programming subject ,so i want to know that u are written a small program in right corner ,will be use in every program .in starting
Yes to declare structure
Nice explanation sir
Hi
Thank you for your support towards our channel share our channel with your friends and keep following our channel.
@@sundeepsaradhi ok sir
Sir can we write this program in lab external xam
Superb explanation sir
Hi
Thank you for your support towards our channel share our channel with your friends and keep following our channel.
Awesome explanation
If it is a single node then will it be circular or not ? U kept it as a normal node
Very well explained
Pls clarify my doubt.....I'm really getting confused....while equating one term to other.....like head=temp.....and....temp=head.....please let me know techique to move in a processed way
I think you will understand better if you go and have a look at singly linked list properly i am sure you will understand
1000th like ❤️
Sir circular Linked list means head value want to print again at the last know sir
sir plz show compilation of program in pc
Sir! Please execute one program on laptop
sir,please give the complete code for linked list
Sir need circular linked list concepts in python as wel as stack and queue
bssttt
❤❤❤❤❤❤
thanks...sir
Sir plzz make the video traversing and serching circuler doubly linked list
Sir while displaying circular linked list inside while loop we can also write temp!=NULL.
it cant be as its a circular list
sir how head is null at starting , it is pointer variable and it will hold some address(some garbage value) when it is declared so how we are checking head==NULL
the pointer is only there to point to the location where a node exists. If that pointer is not pointing to anything, it will be null. It is a Node pointer (struct pointer) and therefore, if no nodes were instantiated and placed in heap, then head obviously cannot be assigned to anything either.
What is that in ur T shirt sir?
Thanku sir
Sir what is the head and tail for only 1 single node some confusion is theere😇😇
If one node is there that first is considered as head and tail
In if , if(head->next==NULL) should be written instead of if(head==NULL)
Hi
Anything can be written no problem as head points to the address of node.
@@sundeepsaradhi Ok sir
@@Priyanka-oc1lk no it's not same head->next means adress part of head is null.head== null means adress of head is null.it is different.run code on compiler
Light will covering
while assigning the else condition i.e
tail->next=new;
we can also use
head->next=new;
as for the value 10 head n tail r same so can u use head instead of tail ?
head will be pointing to the 1st node,while tail will be used to traverse last node and establish the connection btw 1st node and last node..so he has taken tail-->next=new
Vedio is not clear sirrrr
play this with 0.75 playback speed. for best result play with 0.65 and see what happens 🤣
This is c++
It's C
#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! 😊
thanks sir
good explanation sir