the channel deserves all the best. Very clear. no other channel can explain that much clearly. Great Job! Your students are amazed by you, Neso Academy!
Very thorough explanations on the topic and step by step explanation is perfect. I did not initially understand how these linked lists work but now I do!
Great bro...... 🥺 muje kahi or samaj nhi aa rha tha .. Or english m to itni ache se aya ki hindi m bi nhi shyd kyunki abi Sare hindi k deakh rha tha , base bi learn karne m or sunn ne me boring nhi lagta jab kush interesting sun ne ko mile... 🥀🥀🥀
We will traversing by the ptr ,if it replace with head it can't be a single or double list so, head must points to first node it self And other thing is that it can't be nullified, but it reaches next nide address
Can i able to get Notes of this Course? In your website, i has been statused as "Will be posted soon". These PPTs would help me a lot in my preparations
sir while function declaration it cannot be struct node*head , because head is the variable that we have already called in main . here it should be something else like void count_of_nodes(struct node *ptr) ??
Sir ( struct nide *ptr = NULL) ye declare karne se phle else ne ayaga kyuki apne sab if part main lik diya agar vo sahi huva to compiler baki code read he nahi karega to agar list empty hui to kabhi count possible he nahi hoga if there is another possibility please correct me.
how we will write the program if we have to create linked list by taking the elements by users one by one rather putting data value of nodes itself in program ?
this is how DSA should be taught. Universities take loads of money returning only pain and anxiety. Keep it up !!!!
Absolutely right, this is common condition of maximum universities, so pathetic
The consistency of video is so good that i cannot express it in words. Keep it up Sir.
this course is much better than those paid courses. i have paid course but still i watch neso academy videos. best understanding.
You are a blessing to us sir , thank you for your hardwork for us ❤️
what a visualization!!!just lost my words...you are best best best....love from Bangladesh
the channel deserves all the best. Very clear. no other channel can explain that much clearly. Great Job! Your students are amazed by you, Neso Academy!
Very thorough explanations on the topic and step by step explanation is perfect. I did not initially understand how these linked lists work but now I do!
You can't imagine how long I was searching for the information in your video. THANK YOU.
The best teacher for data structures in this entire universe..... Tq sir
i am very confident about this chapter after these lectures.
Thank you very much
It is so easy to understand the concepts with the help of your teaching, Sir. 🤩
Sir, really you are doing a great work.
the best teacher of linked list I have seen!
Awesome teaching my dear....coach. your voice and clarity of teaching makes me listen a lot....
Super explanation. I am expecting videos on all data structures like stacks, queues etc
Bro thumra video dekar kar pura andar tak feel aa jata hai ki questions kaise proceed kare thanks bro u concept is very clear
Thank you sir for this awesome explanation!
wow i love the visuals! best video explanation so far!!!
Thank you so much sir.....Your channel is a blessing.
Thank you for the great video.
Question: Why do we need to create another pointer(ptr)? Is it not possible to use head pointer only?
The voice of tutor is amazing.
I'm here from almost 1 year...
Your voice is so sweet sir and way of expressing all is marvelous
thanking is not enough for this type of video ,
Love from Bangladesh.
Clearly explained, good examples. Thanks!
Thank you 3/04/2022 , 4:32 pm
Diagrams are helping us ,so keep more diagram contents to learn easily.
Very appreciate these explanations sir, clear and short enough, won't feel any sudden skip of knowledge at all, thank you so much!!
Mashallah
Good explanation sir
Your job is excellent man. Keep up the good work.
Thanks for great contribution in our society............
please make lectures on COA
one of the best websites, thank you sir,..... Godbless you
Awesome sir
Thank you from my heart ❣️
ur lectures are so great than our college's
great work.....keep it up,,,
Great bro...... 🥺 muje kahi or samaj nhi aa rha tha .. Or english m to itni ache se aya ki hindi m bi nhi shyd kyunki abi Sare hindi k deakh rha tha , base bi learn karne m or sunn ne me boring nhi lagta jab kush interesting sun ne ko mile... 🥀🥀🥀
👍🙂 nice detailed explanation
tooooooo gooooood. i am getting this kind of qualityful content in free.
man, you're amazing. thank u and keep it up. could u please make videos about hash tables and functions
.
I have a quiz tomorrow & this is exactly what I needed. Thank u
why create ptr and not use head instead in the loop? For example while(head!=NULL){ count ++; head=head->link;} ?
you will lose your link list like this
head will become null and nothing will be pointing to the link list
You dont want to lose the address of the first node thats why you dont alter head
Then create another pointer other than head and use this logic.
We will traversing by the ptr ,if it replace with head it can't be a single or double list so, head must points to first node it self
And other thing is that it can't be nullified, but it reaches next nide address
I love Neso Academy. 💝
Thank you sir.
Superbly made!!
just excellent sir...
Very nice explanation.....
Sir u cannot imagine how much this helped on the night before the exam
Sir kindly upload videos on Data Structures regularly as exams like GATE 2021, NIELIT are approaching
sir made my life easy thanku
Very clear explanation thank you sir
Amazing ☀️sir
Super explanation
Thank you bro🥳🥳
thanks dear to teach me perfectly
thanks sir
Can i able to get Notes of this Course? In your website, i has been statused as "Will be posted soon". These PPTs would help me a lot in my preparations
Hope, Next video will be amazing like it. All the best.
Awesome 👍👍👍👍👍👍👍👍👍👍👍👏👏👏
brooooo i understooood everything which i was struggling in my university
at 3:42
why is another pointer "ptr" is created, when head is already pointing to the first node?
u havent uploaded lectures on queues??
Neo academy is the best
Sir can u upload lectures on stack queue trees???? I need it very urgent
brother did u complete your c langues from this channel and i have completed loop and how can i practice more program give me guidence
Wow... Thank you
but why you create a new pointer "ptr" when you can do the same with head pointer
while(head -> link != NULL) {
count++;
head = head->link;
}
Why he used in the condition of while loop "ptr" instead of "ptr -> link" ?
Thanku sir😊
Sir, do we use head(link) again and again instead of taking a new ptr, for count?
Nice job sir.... Just one request pls upload atleat 2-3 videos daily I want to learn c in lockdown
C language Videos are already uploaded brother👍 Check the playlist...
This is an best video.......can I get videos for me comps engineering also
i have a doubt why the pointer in first step is initialized to null?
We can initialise to head right?
At the starting , ptr doesn't point anywhere (means null) , after that we will equate to head .
sir why did you wrote "void count_of_nodes(struct node*head);" 2:25
I got cleared..life saviour 😅
I have a question? Why not use the old pointer?
Shouldn't we have to have a "return" (or "exit") at the end of the if statement to prevent the rest of the code from execution?
The function is of void type
sir while function declaration it cannot be struct node*head , because head is the variable that we have already called in main . here it should be something else like void count_of_nodes(struct node *ptr) ??
Can you make video on polynomial representation??
I'm curious. Why do you need to assign 'head' to ptr? Why can't we use head as the while loop condition? For example, while (head != null). Thank you
head has to point to he first node of the list, otherwise you will loose it and not be albe to work on the list anymore
but this function is user defined and this head is not the head of the main function...@@youssefoursana835
Why he used in the condition of while loop "ptr" instead of "ptr -> link" ?
When will data structures end sir? For time management I am asking please tell
Pls suggest that which book should i prefer for digital and analog electronics.
Author-Anand sharma
This is how DSA should be taught
Do you still create a pointer to the struct node if you pass the struct node with a "const" in the count_of_nodes?
There should be an exit function in if block or else even if the list would be empty it would start counting it.
Use of joining
You will get the access of "Interview Preparation Guide" video series.
Sir I want prepare for gate
This u can provide extra videos for gate sir
We are working in the direction to complete the syllabus for GATE.
By joining on it u can provide extra gate videoa
Sir Data Structures ke videos continue kab se aayega??
but we havent defined the head pointer right?how do we do that?
Sir
( struct nide *ptr = NULL)
ye declare karne se phle else ne ayaga kyuki apne sab if part main lik diya agar vo sahi huva to compiler baki code read he nahi karega to agar list empty hui to kabhi count possible he nahi hoga if there is another possibility please correct me.
Sir is it necessary for ptr to be initialised as "null". Can't it be left as such
It is not necessary but it is good practice...watch previous videos.
how we will write the program if we have to create linked list by taking the elements by users one by one rather putting data value of nodes itself in program ?
How are you passing head in the function, it isn't defined
oh so we used ptr just because we dont want to move head from the first position, i got it thanks
Explanation is perfect but in the program when we call the count of nodes then error is produced
Sir please give the answer
Best
Code is showing error that dereferencing pointer to incomplete type
5:42
Hello bhaiya mujhe aapka DSA ka course purchase karna he
Where is the another way of writing this code sir
I'm not able to mrz it with previous code... Can someone explain it plzz
i thought there should be an else after the if statement ,,
shouldnt the count start from 1?