Height of Binary Tree | Height of a Binary Tree | Binary Tree Data Structure | DSA-One Course #57

[@gwalaniarun]

You are a blessing to us. Never stop this series, please.

[@aswithasai4015]

height is -1 for empty node i think it should be written return -1 when root is NULL.

[@sasidharnaidu4507]

That's as per your problem statement.

[@Anashwar-p3w]

by far the best explanation of this problem in whole youtube.

[@pragyanpandey662]

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.

[@630_anishabirla8]

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 !!!!!!!!!!!!!!!!!!!!!!!!!!!

[@abirbanerjee839]

THIS IS THE BEST VIDEO ON THE HEIGHT OF BINARY TREE

[@TheMdaliazhar]

I like your visual explanation better than any other youtuber. Please make more leetcode problem videos.

[@Lifeofkashh31]

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!

[@nandiniverma5273]

Made soo easy to understand recursive call in this height.

[@kartikchauhan2778]

excellent video bhaiya, call stack understood

[@ArjunGupta-dj7ot]

Thanks for being consistent, Really like your videos

[@Sagar__Raj]

Nice getting boost day by day by seeing ur videos

[@riyazsayyad4047]

Recursion me phas gya tha litreally, Thanks @Anuj Bhaiys

[@ramjeetkumar7212]

You tube er best job h

[@kajalkhirodkar6521]

A very helpful video for understanding this concept. Thank you !!

[@RAMANKUMARGCEBIT]

thank u for the video. recursive callstack explanation was very good.

[@hannanhub1717]

very simple explanation

[@himanshusinghparmar5816]

Thank you and continue this series bhaiya
God bless you

[@nithinthota96]

simply superb!

[@akshaykumar192]

Bhaiya aapki video mujhe jaldi samaj aati hai

[@abantikakarmakar1988]

Thank you sir for your hardwork!!

[@Nitin12577]

it was very very good explanation

[@youtubekumar8590]

Thanks bhaiya

[@siddhigolatkar8558]

Thank you

[@bhushankorg5606]

Thanks!! very important concept.....

[@THENIKSHOW-tp5hy]

Thankyou ❤

[@kcode4100]

great work bhai keep it up 🤩🤩

[@tech_and_memes]

got it bhaiya also practiced it on gfg

[@softmedun6794]

👉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;
}

[@coding9.99]

after i listning recursion k deep me nhi jana hota hai upar upar se kr ke nikl jana hota hai >>>>> 3

[@vcs649]

wonderful explanation

[@tekno864]

Video is very very helpful !!!!!!!!!!!!!!!!
Thanku bhaiya

[@richaofficial7638]

Thank you
Nice
❣❣

[@bibekjoshi34]

thanks

[@GahanaD]

Awesome☺☺☺🤯🤯

[@lokendrasingh9780]

thank you bhaiya 🙏❤️

[@lokanathpatasahani897]

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.

[@PROGRAMMINGNERDS]

BHAIYA KYA PADATE HO YRR TUM MAJE AA GYE

[@arjunkurariya2235]

1st Comment ❤️❤️. Bhaiya muje Refferal dilwa doo pls. Meine 500+ DSA q. Solve kiye h. Help me🙏🙏

[@balavardhanreddy8581]

very greatful

[@saritaprasad4295]

good one

[@NitishShuklaOfficial]

best

[@vikasprajapati6558]

#DSAONE

[@amrish_kumar142]

Iteratiive bi bta dijiye

[@vatsalyadubey641]

[@pushparay5554]

Amazing❤

[@abhijitchakraborty6035]

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.

[@dekhbhai9328]

yes you are correct.

[@akritirawat135]

Height should be 3 no of edges from the root node...

[@deepikatripathi9269]

Excuse me sir, what will be the height of the binary tree "if the root of the tree is 0" is mentioned?

[@Gamer-uz7dl]

Just change return 0 to return -1

[@obaidurrahman7216]

This code returns height is 3. Which is correct?

[@basavarajhasarmani6231]

Height and depth of only one node in tree is zero(0) not (1)

[@SaurabhPatel-w9b]

Both are correct as per different books

[@emanniaz7980]

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

[@arpanmaheshwari2290]

Hum first!!

[@Prakashvishwakarma1]

Sir I'm BCA graduate and reactJS ki job mil rahi hi 5 hajar salary hi should I do job Or MCA?

[@10daysAgo]

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 👍

[@mahadishakkhor123]

very helpful

[@RN-jo8zt]

how come there are two defination for height of tree?

[@lokeshwarprasad9614]

First ❤️❤️❤️

[@dhananjaysingh3675]

👌👌🙏

[@awesome-kl9ci]

Bhaiya aage ki video kB nikalo gay

[@shiv_all_in_1]

Bhai iss playlist ko jaldi khatam kro, waiting for Graph videos

[@himanshusharma9239]

hi

[@sumitkumar-rj6ht]

Start 0 to n ?

[@dekhbhai9328]

height 3 hai

[@praveenvasu6960]

Bhai

[@DhruvSharma-wb4li]

iski height 3nhi hogi kya?

[@dekhbhai9328]

3 hogi bhai

[@himanshusharma9239]

yo

[@tarunkotla1856]

amazing explanation

[@Akash-dd6ev]

Thank you bhaiyya

[@adilhassan2093]

Thank you bhaiya

[@sujitojha6071]

thank you so much guru