Тёмный

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

Anuj Bhaiya
Подписаться 500 тыс.
Просмотров 91 тыс.
50% 1

Опубликовано:

 

20 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 75   
@gwalaniarun
@gwalaniarun 2 года назад
You are a blessing to us. Never stop this series, please.
@Anashwar-p3w
@Anashwar-p3w Месяц назад
by far the best explanation of this problem in whole youtube.
@aswithasai4015
@aswithasai4015 2 года назад
height is -1 for empty node i think it should be written return -1 when root is NULL.
@sasidharnaidu4507
@sasidharnaidu4507 8 месяцев назад
That's as per your problem statement.
@kartikchauhan2778
@kartikchauhan2778 2 года назад
excellent video bhaiya, call stack understood
@abirbanerjee839
@abirbanerjee839 7 месяцев назад
THIS IS THE BEST VIDEO ON THE HEIGHT OF BINARY TREE
@pragyanpandey662
@pragyanpandey662 2 года назад
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.
@tarunkotla1856
@tarunkotla1856 9 месяцев назад
amazing explanation
@ArjunGupta-dj7ot
@ArjunGupta-dj7ot 2 года назад
Thanks for being consistent, Really like your videos
@630_anishabirla8
@630_anishabirla8 2 года назад
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 !!!!!!!!!!!!!!!!!!!!!!!!!!!
@nandiniverma5273
@nandiniverma5273 2 года назад
Made soo easy to understand recursive call in this height.
@Sagar__Raj
@Sagar__Raj 2 года назад
Nice getting boost day by day by seeing ur videos
@TheMdaliazhar
@TheMdaliazhar 4 месяца назад
I like your visual explanation better than any other youtuber. Please make more leetcode problem videos.
@Lifeofkashh31
@Lifeofkashh31 2 года назад
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!
@kajalkhirodkar6521
@kajalkhirodkar6521 2 года назад
A very helpful video for understanding this concept. Thank you !!
@hannanhub1717
@hannanhub1717 2 месяца назад
very simple explanation
@sujitojha6071
@sujitojha6071 6 месяцев назад
thank you so much guru
@RAMANKUMARGCEBIT
@RAMANKUMARGCEBIT 2 года назад
thank u for the video. recursive callstack explanation was very good.
@ramjeetkumar7212
@ramjeetkumar7212 2 года назад
You tube er best job h
@riyazsayyad4047
@riyazsayyad4047 Год назад
Recursion me phas gya tha litreally, Thanks @Anuj Bhaiys
@abantikakarmakar1988
@abantikakarmakar1988 2 года назад
Thank you sir for your hardwork!!
@himanshusinghparmar5816
@himanshusinghparmar5816 2 года назад
Thank you and continue this series bhaiya God bless you
@bhushankorg5606
@bhushankorg5606 2 года назад
Thanks!! very important concept.....
@akshaykumar192
@akshaykumar192 2 года назад
Bhaiya aapki video mujhe jaldi samaj aati hai
@siddhigolatkar8558
@siddhigolatkar8558 10 месяцев назад
Thank you
@Nitin12577
@Nitin12577 Год назад
it was very very good explanation
@youtubekumar8590
@youtubekumar8590 2 года назад
Thanks bhaiya
@kcode4100
@kcode4100 2 года назад
great work bhai keep it up 🤩🤩
@THENIKSHOW-tp5hy
@THENIKSHOW-tp5hy Месяц назад
Thankyou ❤
@coding9.99
@coding9.99 Год назад
after i listning recursion k deep me nhi jana hota hai upar upar se kr ke nikl jana hota hai >>>>> 3
@tekno864
@tekno864 2 года назад
Video is very very helpful !!!!!!!!!!!!!!!! Thanku bhaiya
@richaofficial7638
@richaofficial7638 2 года назад
Thank you Nice ❣❣
@GahanaD
@GahanaD 21 день назад
Awesome☺☺☺🤯🤯
@tech_and_memes
@tech_and_memes 2 года назад
got it bhaiya also practiced it on gfg
@bibekjoshi34
@bibekjoshi34 Год назад
thanks
@balavardhanreddy8581
@balavardhanreddy8581 Год назад
very greatful
@saritaprasad4295
@saritaprasad4295 Год назад
good one
@softmedun6794
@softmedun6794 11 месяцев назад
👉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; }
@obaidurrahman7216
@obaidurrahman7216 Год назад
This code returns height is 3. Which is correct?
@amrish_kumar142
@amrish_kumar142 2 года назад
Iteratiive bi bta dijiye
@pushparay5554
@pushparay5554 2 года назад
Amazing❤
@arpanmaheshwari2290
@arpanmaheshwari2290 2 года назад
Hum first!!
@NitishShuklaOfficial
@NitishShuklaOfficial 5 месяцев назад
best
@lokanathpatasahani897
@lokanathpatasahani897 2 года назад
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.
@akritirawat135
@akritirawat135 10 месяцев назад
Height should be 3 no of edges from the root node...
@arjunkurariya2235
@arjunkurariya2235 2 года назад
1st Comment ❤️❤️. Bhaiya muje Refferal dilwa doo pls. Meine 500+ DSA q. Solve kiye h. Help me🙏🙏
@RN-jo8zt
@RN-jo8zt 8 месяцев назад
how come there are two defination for height of tree?
@haedshotgaming5284
@haedshotgaming5284 2 года назад
BHAIYA KYA PADATE HO YRR TUM MAJE AA GYE
@deepikatripathi9269
@deepikatripathi9269 2 года назад
Excuse me sir, what will be the height of the binary tree "if the root of the tree is 0" is mentioned?
@Gamer-uz7dl
@Gamer-uz7dl 2 года назад
Just change return 0 to return -1
@vikasprajapati6558
@vikasprajapati6558 2 года назад
#DSAONE
@vatsalyadubey641
@vatsalyadubey641 Год назад
@mahadishakkhor123
@mahadishakkhor123 Год назад
very helpful
@lokeshwarprasad9614
@lokeshwarprasad9614 2 года назад
First ❤️❤️❤️
@basavarajhasarmani6231
@basavarajhasarmani6231 Год назад
Height and depth of only one node in tree is zero(0) not (1)
@SaurabhPatel-w9b
@SaurabhPatel-w9b 5 месяцев назад
Both are correct as per different books
@emanniaz7980
@emanniaz7980 4 месяца назад
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
@Prakashvishwakarma1
@Prakashvishwakarma1 2 года назад
Sir I'm BCA graduate and reactJS ki job mil rahi hi 5 hajar salary hi should I do job Or MCA?
@10daysAgo
@10daysAgo 2 года назад
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 👍
@abhijitchakraborty6035
@abhijitchakraborty6035 2 года назад
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
@dekhbhai9328 2 года назад
yes you are correct.
@sumitkumar-rj6ht
@sumitkumar-rj6ht 5 месяцев назад
Start 0 to n ?
@awesome-kl9ci
@awesome-kl9ci 2 года назад
Bhaiya aage ki video kB nikalo gay
@dhananjaysingh3675
@dhananjaysingh3675 2 года назад
👌👌🙏
@DhruvSharma-wb4li
@DhruvSharma-wb4li 2 года назад
iski height 3nhi hogi kya?
@dekhbhai9328
@dekhbhai9328 2 года назад
3 hogi bhai
@himanshusharma9239
@himanshusharma9239 2 года назад
hi
@shivautozone
@shivautozone 2 года назад
Bhai iss playlist ko jaldi khatam kro, waiting for Graph videos
@dekhbhai9328
@dekhbhai9328 2 года назад
height 3 hai
@praveenvasu6960
@praveenvasu6960 2 года назад
Bhai
@himanshusharma9239
@himanshusharma9239 2 года назад
yo
@Akash-dd6ev
@Akash-dd6ev Год назад
Thank you bhaiyya
@vcs649
@vcs649 Год назад
wonderful explanation
@lokendrasingh9780
@lokendrasingh9780 2 года назад
thank you bhaiya 🙏❤️
@adilhassan2093
@adilhassan2093 Год назад
Thank you bhaiya
Далее
10.1 AVL Tree - Insertion and Rotations
43:08
Просмотров 1,2 млн
🎙ПОЮ ВЖИВУЮ!
3:07:23
Просмотров 913 тыс.
Viral Video of a Man's Crazy Job Interview
16:02
Просмотров 1,4 млн
LeetCode was HARD until I Learned these 15 Patterns
13:00
Fastest way to learn Data Structures and Algorithms
8:42
L15. Check for Balanced Binary Tree | C++ | Java
12:30
Просмотров 344 тыс.
Binary Trees - Data Structures Explained
10:18
Просмотров 132 тыс.
Height of a Binary Tree
10:51
Просмотров 163 тыс.