It's really commendable that after getting a well paid job at one of the dream company, Anuj Bhaiya has still given his efforts to continue working on this series and make other videos to help u. It's very easy to get those money and enjoy life, but to work this hard even after achieving great things, it is commendable.
Anuj bhaiya u r love ,u have made many people's life,u r so self-less ,u r posting this world class stuff to us for free,u r not only hardworking u r selfless,u r my hero,u r such a beautiful soul who give students quality teaching for freee and here are in my college who are asking for money for everything whether its coding or internship .U r real hero !!!!!!!!!!!!!!!!!!!!!!!!!!!
bhiya litrally i am thankful to u for this playlist yaar! This is sooooo dammm good Thankyou for so much hardwork!The most humble youtuber i have ever seen in my life!
👉But sir single node ke lie to height 1 aa jayega jo ki galat hai , height 0 ana chahiye Isme ek or condition hona chahiye....... if(root->left ==nullptr && root->right==nullptr ){ return 0; }
Sir as a fresher I can apply in which positions in companies, like can I apply for jobs for freshers as well as in support Engineer role. Please 🙏 answer me. Because very few jobs are coming for freshers so can I apply for those positions in which it's asking for 1/2 years of experience if I have 1/2 good internships.
Bhai sirf 5 hazar ? Itna to tumhe ese hi koi pathology lab ke accounts department mein job se mil jayega . Infact atleast 12-15k to milenge hi . Lekin agar karna hi hai to experience ke liye karo 👍
Hi Anuj bhaiya, I guess the height of tree should be 3 not 4 because the height is given by the sum no. of edges in the binary tree. Please correct me if I am wrong.
You are a blessing to us. Never stop this series, please.
height is -1 for empty node i think it should be written return -1 when root is NULL.
That's as per your problem statement.
It's really commendable that after getting a well paid job at one of the dream company, Anuj Bhaiya has still given his efforts to continue working on this series and make other videos to help u. It's very easy to get those money and enjoy life, but to work this hard even after achieving great things, it is commendable.
by far the best explanation of this problem in whole youtube.
Anuj bhaiya u r love ,u have made many people's life,u r so self-less ,u r posting this world class stuff to us for free,u r not only hardworking u r selfless,u r my hero,u r such a beautiful soul who give students quality teaching for freee and here are in my college who are asking for money for everything whether its coding or internship .U r real hero !!!!!!!!!!!!!!!!!!!!!!!!!!!
THIS IS THE BEST VIDEO ON THE HEIGHT OF BINARY TREE
bhiya litrally i am thankful to u for this playlist yaar! This is sooooo dammm good Thankyou for so much hardwork!The most humble youtuber i have ever seen in my life!
Thanks for being consistent, Really like your videos
excellent video bhaiya, call stack understood
after i listning recursion k deep me nhi jana hota hai upar upar se kr ke nikl jana hota hai >>>>> 3
I like your visual explanation better than any other youtuber. Please make more leetcode problem videos.
Nice getting boost day by day by seeing ur videos
Made soo easy to understand recursive call in this height.
A very helpful video for understanding this concept. Thank you !!
Recursion me phas gya tha litreally, Thanks @Anuj Bhaiys
You tube er best job h
great work bhai keep it up 🤩🤩
Thank you and continue this series bhaiya
God bless you
thank u for the video. recursive callstack explanation was very good.
Thank you sir for your hardwork!!
Bhaiya aapki video mujhe jaldi samaj aati hai
simply superb!
very simple explanation
👉But sir single node ke lie to height 1 aa jayega jo ki galat hai , height 0 ana chahiye
Isme ek or condition hona chahiye.......
if(root->left ==nullptr && root->right==nullptr ){
return 0;
}
Video is very very helpful !!!!!!!!!!!!!!!!
Thanku bhaiya
Thanks!! very important concept.....
Awesome☺☺☺🤯🤯
it was very very good explanation
Interviewer can ask for recursive call stack. Interviewer not assure about the understanding interviewee without recursive call stack.
Sir as a fresher I can apply in which positions in companies, like can I apply for jobs for freshers as well as in support Engineer role.
Please 🙏 answer me.
Because very few jobs are coming for freshers so can I apply for those positions in which it's asking for 1/2 years of experience if I have 1/2 good internships.
wonderful explanation
Thank you
Nice
❣❣
Thankyou ❤
This code returns height is 3. Which is correct?
thank you bhaiya 🙏❤️
Hum first!!
Thanks bhaiya
Excuse me sir, what will be the height of the binary tree "if the root of the tree is 0" is mentioned?
Just change return 0 to return -1
got it bhaiya also practiced it on gfg
First ❤️❤️❤️
Thank you
bhaiya, is there any algorithm to get the height of the tree without using recursion?
BHAIYA KYA PADATE HO YRR TUM MAJE AA GYE
Iteratiive bi bta dijiye
1st Comment ❤️❤️. Bhaiya muje Refferal dilwa doo pls. Meine 500+ DSA q. Solve kiye h. Help me🙏🙏
Height and depth of only one node in tree is zero(0) not (1)
Both are correct as per different books
Because he started indexing from 1 not 0 in most languages we start from 0 but in general we can use either 1 or 0
Amazing❤
how come there are two defination for height of tree?
Height should be 3 no of edges from the root node...
good one
Sir I'm BCA graduate and reactJS ki job mil rahi hi 5 hajar salary hi should I do job Or MCA?
Bhai sirf 5 hazar ? Itna to tumhe ese hi koi pathology lab ke accounts department mein job se mil jayega . Infact atleast 12-15k to milenge hi . Lekin agar karna hi hai to experience ke liye karo 👍
very greatful
thanks
#DSAONE
Bhaiya aage ki video kB nikalo gay
Hi Anuj bhaiya, I guess the height of tree should be 3 not 4 because the height is given by the sum no. of edges in the binary tree. Please correct me if I am wrong.
yes you are correct.
best
Start 0 to n ?
iski height 3nhi hogi kya?
3 hogi bhai
Bhai iss playlist ko jaldi khatam kro, waiting for Graph videos
very helpful
👌👌🙏
height 3 hai
hi
Bhai
yo
amazing explanation
Thank you bhaiyya
Thank you bhaiya
thank you so much guru