Exactly! Didn't value recursion much before watching this video (cause I wasn't aware how powerful it is). But that ReversePrint method is pure gold! Wow!
i login my youtube account just to say you the best... i haved for long trouble to understand the link list data structure until you uploaded your terrific videos actually i lost few days at work just to follow your all courses :) thank you
How can you be so good? No one explains things this well. Without your tutorials, I would have never understood data structures. Can you please make one on heap also?
I would like to say that, hopefully one day in the near future, I will get a job because of the things I learned in your videos. I am still going through your videos so I am eager to learn more. I want to thank you for all you have done. How easily you explain these concepts shows how intelligent you are! Thank you!
All those who are not understanding how the printf function is called , this is what i understood we are making making recursive calls to rp(node *p) , actually printf statement will be called only after the recursive function is executed(completed) but till the last rp(null) we never reached there because we always have other function before printf , now in rp(null) we return from the function RP(NULL) not RP(250) . therefore returning from rp(null) means we have executed rp(250)(becaues rp(null) was called from rp(250)) and therefore now printf(p->data) will be executed. now after printf(p-data) means rp(150) executed((becaues rp(250) was called from rp(150)) , rp(150) execution means we can now call the printf(p->data) and so on... I hope this helps
but when the value of head becomes NULL it should return which means it will terminate from the reverse function without execution of any print statement no?
your videos are my all time recommended videos to any one wants to understand coding in C, I really appreciate the quality and the effort of your videos.
I really had some issues understanding the lessons at first and had to take the help of books along with your lessons but now this lesson was one piece of a gem
Thanks! Your explanation of memory addresses and pointers is excellent. I was able to learn from your example and finish my school project. I also now understand what is happening behind the scenes with my code. Excellent work.
i see that you created these videos almost a year and a half back. i hope i am not asking for a lot, but it would be amazing if you could do some tutorials on java also. actually java is alot like c++ and yet nothing like it. personally, i like java even more, because i had the pleasure of learning it from an amazing teacher. the way he explained things, it seemed like even 2+2 if difficult than java. and that is exactly how anybody would feel after watching you videos too. i understand creating these videos is alot more difficult than just sit around and watch them. but your efforts have paid so much to so many. even if the tutorials on java never show up, i should thank you for what you have provided us so far. wishing you the best in all the future endeavors.
I know I am too late but if you guys are looking for the best Java Tutorials on TH-cam, look no further than Daniel Ross or his website JavacJava.com. I have never seen a course (free/paid) as in-depth as his Java series.
For those looking for java implementation, watch this series th-cam.com/video/jc1t0KFsOcs/w-d-xo.html After watching How to implement LinkedList in Java from there, you will get the gist of it and be able to co-relate, because the only thing that is significantly different is pointers.
HI Kulamani, Right now we are trying to complete playlists on data structure and C fundamentals. Anyway, can you please be more specific. What exactly in C#?
hi Sir Can we have some sessions on C# as well on some topics. I am really enjoying your tutorials and i have a great time in learning the things. Thanks Kulamani
Your way of explanation deserve appreciation. And I know there is involvement of hard work. But I have a doubt in this method of reversing a linked list by recursion becz you have just printed it in reversed way. But there is no any linked list in reverse order. Expect that you will reply soon.
Hello sir, from few days i'm watching ur videos. They are superb. how did you developed such great skills? Also another thing is, I wanted to get into companies such as amazon, facebook. So what all other things i must do along with these tutorials to achieve my goal?
hello sir.! can u please explain the insert function you are using in the video lecture of reversing link list using iterative function and in this video Print elements of a linked list in forward and reverse order using recursion. it will be really helpfull
Very good explanation... I have a request, can you please make tutorial on recursion in loop. How recursion works in in a for loop. Few days back I was searching a program as string permutation, I found the program in Internet but unable to understand how it works. If you can make a tutorial similar to that where recursion is happening inside a loop. That will be great.
Hi! Your videos are saving my life. But I have a question: Why do we initialize head = NULL in the main in the videos? Doesn't globally defining a pointer take care of that? Since it will be in the data memory segment.
No, it's all happening on the stack so that can't happen. When the null condition gets true for p->next, function on top of stack gets returned and it will keep happening until all the functions get removed from stack and the control is passed back to main.
Each function call to recursive fn creates a copy of that function and stored in stack here stack of memory also implement the concept of stake of data structure and first copy of each fn call stored in stack . now LIFO gets applied, last in first out, . So rec fn data clearing out from stack by printing value at address since last one null to first.
I didn't understood the use of return;. As we usually return to main function.Where will it go for next statement execution? And later how printf will be used continuously?
@@pragatitanwar3 Idea of return function is to return from the current function to where it was called from. in a recursive case, it goes back to previous instance where it was called from. Then executes the next line of code in that function. Hope this helps.
As you said in this lecture for reverseprint function that after return; printf statment executes. But how multiple times printf will executes? Does not "return" means exit the function ?
the insert() function could have taken Node** as an argument. pass &p to Insert(). change the value that the Node** p points to, namely Node* p and ur done
Sir,I have one doubt In the program we made head as local pointer in main function and then we are using recursive approach to print elements in list But ,if we made head as global pointer then how can we make algorithm for printing the list by recursion Can anyone explain it
now again if someone having problem with that recursive function then let me explain it . what happen is that when 'p' reaches NULL then the 'return' is executed so it return to the previous function print(250) then the printf () in that print(250) is executed and still 'p' is NULL in that function too so again 'return' is executed and so it return to print (150) and printf () function in print(150) is executed. 'p' is NULL in print(150) too so it again returns to print(200) and printf in print(200) is executed and so on.
in your recursive to print out the ALL, you just used a recursion to recursively to print out the list, you didnt implement an function which traverse on both the array and the lists recursively.
if i write insert(head,2), is the function insert() ( see the vedio at 4:34 for the insert() function) inserting the value 2 at the beginning or at the end ?????
JAVA CODE public void printReverseRecusrive(Node head) { //Forward Order: Print the item in the beginning of the call //System.out.print(head.getValue()+"|"); if(head.getNext()!=null) { printReverseRecusrive(head.getNext()); } System.out.print(head.getValue()+"|");
I just started to appreciate the art of using recursion to reverse something after watching this video! Genius! Thanks for your explanation!
Exactly! Didn't value recursion much before watching this video (cause I wasn't aware how powerful it is). But that ReversePrint method is pure gold! Wow!
Same here
i login my youtube account just to say you the best... i haved for long trouble to understand the link list data structure until you uploaded your terrific videos actually i lost few days at work just to follow your all courses :) thank you
How can you be so good? No one explains things this well. Without your tutorials, I would have never understood data structures. Can you please make one on heap also?
Hi Vikas,
We are using Microsoft Visual Studio Express edition.
I would like to say that, hopefully one day in the near future, I will get a job because of the things I learned in your videos. I am still going through your videos so I am eager to learn more. I want to thank you for all you have done. How easily you explain these concepts shows how intelligent you are! Thank you!
All those who are not understanding how the printf function is called , this is what i understood
we are making making recursive calls to rp(node *p) , actually printf statement will be called only after the recursive function is executed(completed) but till the last rp(null) we never reached there because we always have other function before printf , now in rp(null) we return from the function RP(NULL) not RP(250) .
therefore returning from rp(null) means we have executed rp(250)(becaues rp(null) was called from rp(250)) and therefore now printf(p->data) will be executed.
now after printf(p-data) means rp(150) executed((becaues rp(250) was called from rp(150)) , rp(150) execution means we can now call the printf(p->data) and so on...
I hope this helps
Thank you! This helps a lot. I wasn't understanding for the reverse why recursion calls, and now this makes sense.
but when the value of head becomes NULL it should return which means it will terminate from the reverse function without execution of any print statement no?
@@changumangu4660 how does prunt function passes the value of next node??
Vishal Chandra Podishetty how?
Stepha Nie this doesn’t make sense. Can u explain pls
Became fan of yourself, the way you are explaining is AWESOME. No words man,
You are great.
Thank you for sharing your knowledge here.
your videos are my all time recommended videos to any one wants to understand coding in C, I really appreciate the quality and the effort of your videos.
I really had some issues understanding the lessons at first and had to take the help of books along with your lessons but now this lesson was one piece of a gem
Thanks! Your explanation of memory addresses and pointers is excellent. I was able to learn from your example and finish my school project. I also now understand what is happening behind the scenes with my code. Excellent work.
This is the best example to understand call stacks and how recursion work
Thanks, most clear explanation I've seen so far.
//CODE FOR C++
#include
using namespace std;
struct Node {
int data;
Node* next;
};
/* void Print(Node* ptrHead) { //Prints the output
if(ptrHead == NULL)
return; //Exit condition
cout next); //Recursive call
//printf("%d ",p->data); ->For C
}*/
void ReversePrint(Node* ptrHead) { //Reverse the output
if(ptrHead == NULL)
return; //Exit condition
ReversePrint(ptrHead->next); //Recursive call
//printf("%d ",p->data); ->For C
cout data = data;
temp->next = NULL;
if(head == NULL)
head = temp;
else {
Node* temp1 = head;
while(temp1->next != NULL)
temp1 = temp1->next;
temp1->next = temp;
}
return head;
}
using namespace std;
int main() {
Node* head = NULL; //Local variable
head = Insert(head, 2);
head = Insert(head, 4);
head = Insert(head, 6);
head = Insert(head, 5);
//Print(head);
ReversePrint(head);
return 0;
}
thanks !
Reverse print using recursion explanation is mindblowing!!!!
No one can teach like you....,thank you so much sir.
i see that you created these videos almost a year and a half back. i hope i am not asking for a lot, but it would be amazing if you could do some tutorials on java also. actually java is alot like c++ and yet nothing like it. personally, i like java even more, because i had the pleasure of learning it from an amazing teacher. the way he explained things, it seemed like even 2+2 if difficult than java. and that is exactly how anybody would feel after watching you videos too. i understand creating these videos is alot more difficult than just sit around and watch them. but your efforts have paid so much to so many. even if the tutorials on java never show up, i should thank you for what you have provided us so far. wishing you the best in all the future endeavors.
i am also interested in learning java do you have any idea from where a would start , i mean if you have a name of a youtube channel or a website ....
I know I am too late but if you guys are looking for the best Java Tutorials on TH-cam, look no further than Daniel Ross or his website JavacJava.com. I have never seen a course (free/paid) as in-depth as his Java series.
For those looking for java implementation, watch this series
th-cam.com/video/jc1t0KFsOcs/w-d-xo.html
After watching How to implement LinkedList in Java from there, you will get the gist of it and be able to co-relate, because the only thing that is significantly different is pointers.
Mind blown!!
I would have never thought of a recursive approach to something so seemingly simple and obvious.
best videos ever seen....please make videos on networking,algorithms,database,computer organistion and operating systems
Very clean and beautiful way of explaining the recursion :)
Very clear and detailed explanation. Job well done!
Very good explanation , clear and coherent !
6:38 Mind Blown!!!!
Thank you so much !!!
Now I understood how recursive functions fire in stack !!
he is really a LEGEND!
HI Kulamani,
Right now we are trying to complete playlists on data structure and C fundamentals. Anyway, can you please be more specific. What exactly in C#?
thanks alot sir
For printing reversed list - where should we put "endl" so that the line changes after the list is printed ?
hi Sir
Can we have some sessions on C# as well on some topics.
I am really enjoying your tutorials and i have a great time in learning the things.
Thanks
Kulamani
YOUR VIDEOS ARE WONDERFUL , Thank you very much , you are helping alot by explaining these things , Keeep it up .
Sir, you explained the recursion part really well... :D
I love you man please make more videos about graphs
and some questions on code forces
He is no more !
We will not be able to get more videos of DS from him..
How beautifully explained this video is :--)
Thank u very much. i am very gratefully for all your videos on data structure. you outworked my lecture 10\10. your work helped me allot.
Your way of explanation deserve appreciation. And I know there is involvement of hard work.
But I have a doubt in this method of reversing a linked list by recursion becz you have just printed it in reversed way. But there is no any linked list in reverse order. Expect that you will reply soon.
Hello sir, from few days i'm watching ur videos. They are superb. how did you developed such great skills? Also another thing is, I wanted to get into companies such as amazon, facebook. So what all other things i must do along with these tutorials to achieve my goal?
Amazing...reallllly nice! crystal clear explanation
Really crystal clear explanation :)
thanks for uploading such quality videos of linked list.you are just awesome man..
which book should I refer after your tutorials.
Thank you and may you rest in peace
hello sir.!
can u please explain the insert function you are using in the video lecture of reversing link list using iterative function and in this video Print elements of a linked list in forward and reverse order using recursion.
it will be really helpfull
Very good explanation... I have a request, can you please make tutorial on recursion in loop. How recursion works in in a for loop. Few days back I was searching a program as string permutation, I found the program in Internet but unable to understand how it works. If you can make a tutorial similar to that where recursion is happening inside a loop. That will be great.
Can Someone please explain how the Insert function works here ?
amazing explanation....
excellcent diagrams,so kind of you!
Create some more content please.Even Ready to pay you,You are an amazing Teacher.
Hi!
Your videos are saving my life.
But I have a question:
Why do we initialize head = NULL in the main in the videos? Doesn't globally defining a pointer take care of that? Since it will be in the data memory segment.
ikr.
To ensure there isn't any garbage value because we have to later use the head node a lot in functions
Yeah but any variable (including a pointer) is initialized to NULL if defined globally. There won't be any garbage value associated with it,
Try doing it without initializing it to null, then see how the program works, and let me know as well, because I'm a beginner in coding.
thank you sir,,, very helpful and easier then my method...!
if p == null
return;
so why printf statement even execute
in case p!=null
Great tutorial!
Instead of passing an argument ,Can we just use a local pointer variable and static variable?
i dont get the passing head as a copy. If you want to modify it like you stated wouldn't you pass it by reference?
Lectures are good. Is there a website to download these example programs?
Thank you !!!!
GENIUS
I can't understand how after calling return when p=null the function is calling printf ! should it not pass the execution to main?
same doubt !!
No, it's all happening on the stack so that can't happen. When the null condition gets true for p->next, function on top of stack gets returned and it will keep happening until all the functions get removed from stack and the control is passed back to main.
Goutam Bose we must refer recursion now I got this clear
Each function call to recursive fn creates a copy of that function and stored in stack here stack of memory also implement the concept of stake of data structure and first copy of each fn call stored in stack . now LIFO gets applied, last in first out, . So rec fn data clearing out from stack by printing value at address since last one null to first.
Just Beautiful!
I didn't understood the use of return;. As we usually return to main function.Where will it go for next statement execution? And later how printf will be used continuously?
monil shah I also got stuck on this, can anyone please answer?
@@pragatitanwar3 Idea of return function is to return from the current function to where it was called from. in a recursive case, it goes back to previous instance where it was called from. Then executes the next line of code in that function. Hope this helps.
Now I understood the power of recursion
i dn't hv any words to say,otherwise u vl b bored :) great nd also lv ur voice
As you said in this lecture for reverseprint function that after return; printf statment executes. But how multiple times printf will executes? Does not "return" means exit the function ?
Same doubt
Can anyone explain it
very intuitive.
Me reading all comments from 4-5 yrs back instead of learning what i came for.
Anyone else like me?
Just amazing
Thank you for all
the insert() function could have taken Node** as an argument. pass &p to Insert(). change the value that the Node** p points to, namely Node* p and ur done
@7:26 blows my mind!
When you are trying to get a good grasp on recursion, I recommend first getting a good grasp on recursion.
Thanks :)
We better create Node* tail pointer that points to the end node of the list.
sir in recursion (at 12:58) after exiting how its fall in the same loop.it should go back to previous loop i think ,please explain
Sir,I have one doubt
In the program we made head as local pointer in main function and then we are using recursive approach to print elements in list
But ,if we made head as global pointer then how can we make algorithm for printing the list by recursion
Can anyone explain it
Great Thanks lot !
which software u r using to capture screen, i m using camstudio,, but can't create video-audio properly
i dont get the reverse print logic someone help
u dont get it because it is seriously wrong
Why nodes are placed in heap section of memory? Even though we did not made node using malloc.
kindly piss off
living legend
thank u brother
The Two Functions
void print(node *traverse)
{
if (!traverse)
return;
printf("%d
", traverse->data);
print(traverse->ptr);
}
void reverse_print(node *traverse)
{
if (!traverse)
return;
reverse_print(traverse->ptr);
printf("%d
", traverse->data);
}
Hi sir,
You are awesome! Keep up! :) :)
gr8888 video
please answer
is there a difference in
head= temp1->next ;
temp1->next=head; ?
in first you are changing the value of head equals to temp1->next. in second youre changing the value of temp1->next equals to head
please explain me ....why head=insert(head,value);.....why you are assigning it to head ??
if the head value is modified, it will be updated this way
now again if someone having problem with that recursive function then let me explain it .
what happen is that when 'p' reaches NULL then the 'return' is executed so it return to the previous function print(250) then the printf () in that print(250) is executed and still 'p' is NULL in that function too so again 'return' is executed and so it return to print (150) and printf () function in print(150) is executed. 'p' is NULL in print(150) too so it again returns to print(200) and printf in print(200) is executed and so on.
thank you very much. your explantion helps me to understand still now. once again thank you.
how does print function passes the value of nest node
Or better if (p->next) Print(p) it avoids an unnecessary jump
but insert function takes pointer as parameter , so why would main send the copy of head ? shouldn't it send the adress?
head contains nothing but the address of first node only. so yeah, that's a pointer
void rev(head)
{
struct node* A,B;
A=head;
B->next=NULL;
while(A!=NULL)
{
B=A;
A=A->next;
A->next=B;
}
head=A;
}
whats wrong in this code ....can anyone tell me
THANK BRO
what if i put flushall() after printf("%d", p->data)??
12:00
in your recursive to print out the ALL, you just used a recursion to recursively to print out the list, you didnt implement an function which traverse on both the array and the lists recursively.
Cant we just call standart print implementation in main fuction after we call REVERSE()? ... im referencing on previous lesson
+Johnny Batafljeska We could, but this way, you dont have to call the reverse function
If anyone has a problem with struct Node* Insert change the code to this:
#include
#include
typedef struct {
int data;
struct Node* next;
} Node;
void Print(Node* p)
{
if(p == NULL) return;
printf("%d ", p->data);
Print(p->next);
}
Node* Insert(Node* head, int data){
Node* temp = (Node*)malloc(sizeof(Node));
temp->data = data;
temp->next = NULL;
if(head == NULL) head = temp;
else {
Node* temp1 = head;
while(temp1->next != NULL) temp1 = temp1->next;
temp1->next = temp;
}
return head;
}
int main()
{
struct Node* head = NULL;
head = Insert(head,2);
head = Insert(head,4);
head = Insert(head,6);
head = Insert(head,5);
Print(head);
}
Java implementation continues:
public void printUsingRecursion(Node head) {
// Has 2 parts
// 1. End statement
// 2. Recursive statement.
// Base Condition / Exit statement.
if(head.next == null) return;
System.out.println(head.next.data);
// Recursive statement.
printUsingRecursion(head.next);
}
Expose head variable using a function:
public Node getHead() {
return head;
}
How to call this function:
@Test
public void printUsingRecursion() {
LinkedList list = new LinkedList();
list.add(9);
list.add(8);
list.add(7);
list.add(6);
list.add(5);
list.add(4);
list.add(3);
list.add(2);
list.add(1);
list.add(0);
list.printUsingRecursion(list.getHead());
}
if i write insert(head,2), is the function insert() ( see the vedio at 4:34 for the insert() function) inserting the value 2 at the beginning or at the end ?????
+Amarnath Nayak it is inserting the value at the end of the list
#include
#include
#include
this code is not running or compile
at the 36th line it's showing error
struct Node{
int data;
struct Node* next;
};
void Print(struct Node* head)
{
if(head=NULL){
printf("%d",head->data);
Print(head->next);
}
struct Node* Insert(struct Node* head , int data){
struct Node* temp=(struct Node*)malloc(sizeof(struct Node));
temp->data=data;
temp->next=NULL;
if(head ==NULL) head=temp;
else{
struct Node* temp1=head;
while(temp1->next!=NULL) temp1=temp1->next;
temp1->next=temp;
}
return head;
}
int main(){
struct Node* head=NULL;
head=Insert(head,2);
head=Insert(head,6);
head=Insert(head,4);
head=Insert(head,5);
head=Insert(head,8);
Print(head);
}
Missing a closing brace at the print function
lol
I mean some doing not only the basics
Perfect 👌 example of keep it simple and stupid
#include
#include
struct Node {
int data;
struct Node* next;
};
void Print(struct Node* p) {
if (p == NULL) return; //exit condition
Print(p->next); // Recursive call
printf("%d", p->data); //First print the value in the node
}
struct Node* Insert(Node* head, int data) {
Node* temp = (struct Node*)malloc(sizeof(struct Node));
temp->data = data;
temp->next = NULL;
if (head == NULL) head = temp;
else {
Node* temp1 = head;
while (temp1->next != NULL) temp1 = temp1->next;
temp1->next = temp;
}
return head;
}
int main()
{
struct Node* head = NULL;
head = Insert(head, 2);
head = Insert(head, 4);
head = Insert(head, 6);
head = Insert(head, 5);
Print(head);
}
JAVA CODE
public void printReverseRecusrive(Node head) {
//Forward Order: Print the item in the beginning of the call
//System.out.print(head.getValue()+"|");
if(head.getNext()!=null) {
printReverseRecusrive(head.getNext());
}
System.out.print(head.getValue()+"|");
}