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.

[@Anashwar-p3w]

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

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

[@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.

[@abirbanerjee839]

THIS IS THE BEST VIDEO ON THE HEIGHT OF BINARY TREE

[@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.

[@TheMdaliazhar]

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

[@riyazsayyad4047]

Recursion me phas gya tha litreally, Thanks @Anuj Bhaiys

[@kartikchauhan2778]

excellent video bhaiya, call stack understood

[@ramjeetkumar7212]

You tube er best job h

[@nandiniverma5273]

Made soo easy to understand recursive call in this height.

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

[@Sagar__Raj]

Nice getting boost day by day by seeing ur videos

[@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; }

[@ArjunGupta-dj7ot]

Thanks for being consistent, Really like your videos

[@kajalkhirodkar6521]

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

[@akshaykumar192]

Bhaiya aapki video mujhe jaldi samaj aati hai

[@himanshusinghparmar5816]

Thank you and continue this series bhaiya God bless you

[@hannanhub1717]

very simple explanation

[@RAMANKUMARGCEBIT]

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

[@nithinthota96]

simply superb!

[@abantikakarmakar1988]

Thank you sir for your hardwork!!

[@coding9.99]

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

[@Nitin12577]

it was very very good explanation

[@tekno864]

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

[@kcode4100]

great work bhai keep it up 🤩🤩

[@youtubekumar8590]

Thanks bhaiya

[@bhushankorg5606]

Thanks!! very important concept.....

[@vcs649]

wonderful explanation

[@tech_and_memes]

got it bhaiya also practiced it on gfg

[@siddhigolatkar8558]

Thank you

[@THENIKSHOW-tp5hy]

Thankyou ❤

[@GahanaD]

Awesome☺☺☺🤯🤯

[@richaofficial7638]

Thank you Nice ❣❣

[@PROGRAMMINGNERDS]

BHAIYA KYA PADATE HO YRR TUM MAJE AA GYE

[@lokendrasingh9780]

thank you bhaiya 🙏❤️

[@arjunkurariya2235]

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

[@arpanmaheshwari2290]

Hum first!!

[@bibekjoshi34]

thanks

[@balavardhanreddy8581]

very greatful

[@saritaprasad4295]

good one

[@pushparay5554]

Amazing❤

[@vatsalyadubey641]

[@NitishShuklaOfficial]

best

[@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.

[@amrish_kumar142]

Iteratiive bi bta dijiye

[@SwayamBhoir-p4q]

bhaiya, is there any algorithm to get the height of the tree without using recursion?

[@akritirawat135]

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

[@vikasprajapati6558]

#DSAONE

[@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

[@lokeshwarprasad9614]

First ❤️❤️❤️

[@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

[@RN-jo8zt]

how come there are two defination for height of tree?

[@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.

[@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 👍

[@shiv_all_in_1]

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

[@awesome-kl9ci]

Bhaiya aage ki video kB nikalo gay

[@mahadishakkhor123]

very helpful

[@dhananjaysingh3675]

👌👌🙏

[@himanshusharma9239]

hi

[@dekhbhai9328]

height 3 hai

[@sumitkumar-rj6ht]

Start 0 to n ?

[@praveenvasu6960]

Bhai

[@himanshusharma9239]

yo

[@DhruvSharma-wb4li]

iski height 3nhi hogi kya?

[@dekhbhai9328]

3 hogi bhai

[@tarunkotla1856]

amazing explanation

[@Akash-dd6ev]

Thank you bhaiyya

[@adilhassan2093]

Thank you bhaiya

[@sujitojha6071]

thank you so much guru