You're the best. I know recursive tracing takes a long time and can be annoying, but I really wish more professors would go through the processes like this.
Thank you so much 😀 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Are we supposed to visualise this complex step by step process everytime we write recursion? Or just write recursion based on intution, getting some idea what it does but not knowing exactly how it does?
sir can you please tell me why we use return -1 instead of return 0 in height function and return left + 1 or right + 1 instead of return left and right.
you can also think of it as, the height of the leaf node it self is 0 , so you return -1 for left node of the leaf node ,and -1 for the right node of the leaf node max(-1,-1)+1 --> 0 , so the height of leaf nodes is 0
My manager is the type of man that most people would like to invest with, he's not the best of all. But it's more about what he knows about the market and his predictions are accurate. You can try to see for yourself.
I have not seen youtuber like him, great work!
No music no intro just the lecture.
You're the best. I know recursive tracing takes a long time and can be annoying, but I really wish more professors would go through the processes like this.
Amazing... I think no one can explain better than you...Thanks a lot sir..
Bs Yehi Speed Se Upload Krte Rho Bhai
Thank U ❤️
The best explanation and the best presentation. The way you explain concepts is simply perfect
absolutely beautiful with the dry run for the pseudo code, you're a very articulate instructor. loved the tutorial!
Approach to explain recursion is nice bro, it really makes more sense now
Please Create some videos on templates, vectors , maps , iterators
This video finally made it click for me. Thank you.
Best explained I have seen for height of a tree.
tanmay bro! you are doing such a very good hard work ......
thank you so so so much
Lovely explanation...thank you ❤❤❤
He is a wonderful creator
More compact version:
int height(Tree *r)
{
if(r==NULL)
return 0;
return max(height(r->left)+1,height(r->right)+1);
}
Wonderful explanation bro. Keep it up!!
Cheers✌✌
Thank you so much 😀 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
U are a Legend man Brother
Underrated video.
please make some videos on map vectors sets as we need them in cp please please
Are we supposed to visualise this complex step by step process everytime we write recursion? Or just write recursion based on intution, getting some idea what it does but not knowing exactly how it does?
I keep asking this question to myself 😅 I suppose you get the hang of it slowly as you keep practicing recursion based algorithms
@@SimpleSnippets XD..Thanks !
you are the best...............masum
hey thanks perfect explanation
sir can you please tell me why we use return -1 instead of return 0 in height function and return left + 1 or right + 1 instead of return left and right.
Because height is one less than the levels. Try dry running the code and it should make sense.
you can also think of it as, the height of the leaf node it self is 0 , so you return -1 for left node of the leaf node ,and -1 for the right node of the leaf node max(-1,-1)+1 --> 0 , so the height of leaf nodes is 0
Best explanation ever
🥲 thank you very much !!!
also upload the left out approach for the codes
SIR WHEN WILL YOU UPLOAD THE REMAINING VIDEOS CAN U TELL??
Is the playlist complete
Nope, will take lot of time
waiting for the more videos sir
In line 2.3 and 2.4, why not subtract them? Lh - rh gives the same answer does it not?
nice explanation bro
Can you please complete the dsa playlist asap. heaps hash tables and graphs
Will try but it takes a lot of time
Why we sent obj.root ??
Thanks 🤍
Very nice , thank you 😄😄
So nice of you
thank you
You're welcome
Mast laga
Thank you, Sir
thank you sir
Most welcome
How to find specific node's height??
Traverse till that node first and then call the height function
bhai height is 3 here not 2
First viewer
Height should be 3 !!
My manager is the type of man that most people would like to invest with, he's not the best of all. But it's more about what he knows about the market and his predictions are accurate. You can try to see for yourself.