Largest BST Subtree - Solution | Binary Trees | Data Structure and Algorithms in JAVA

preview_player
Показать описание


Рекомендации по теме
Комментарии
Автор

Sir ji, you are great! Your patience & dedication is appreciable. There's a lot to learn from you. Thanks!

amazinglife
Автор

I was going for greeks of greeks , but after lot of internet search, i found prepcoding (more solutions, easy to understand sir lecture) just awesome
Thanks sir 😄

a.techsys
Автор

I just get amazed every time i see Sumeet sir explaining things, hatsoff to you sir.

arnabchatterjee
Автор

Thank you so much sir for a great explanation and clearing both concepts i.e. Travel and change as well as modifying pair class to solve different tree questions. I am able to come up with at least one solution using any one of the approach before even looking at solution.

sudhanshusharma
Автор

Bhai Explaination toh kadak hota hai tumhara, thanks a lot. If i search any problem in youtube to understand and your video is in result, no need to open any other video. I kind of get that comfortable feeling "are bhai ne samjha k video dala hua hai, ho gaya kaam, lets play"

anuragagnihotri
Автор

Thank you Sir

Was able to solve all Binary tree questions on Leetcode (easy medium hard) after understanding the game.

kapildeshmukh
Автор

No one gets this much deeper into question unless he is Sumeet Sir.🔥🔥

sarangr
Автор

Never thought binary trees would be that much easy, thank you sir, waiting for the next topic😀

ayushgoel
Автор

what an explanation ! Awesome Sir ji🔥

AshwaniSharma-zwwq
Автор

gajab explanation sir!! aap bohot enthusiastic hain.. mere college ke teachers ka combined enthusiasm toh negative me jata hoga😂

fanigo
Автор

14:27 sir jab aapne bola na ki ye baat yaha smjh ni ayegi, ushi time sab smjh aaya

nischayrawat
Автор

what the explanation sir ji....your videos helps me a lot to get dedication towards questions.
thank you

rishabhkumar
Автор

Sir logic soch liya tha revision ker rha hu sir notes bnaker to vidow solution dekhte huwe notes bna rha hu kyoki sir revision kerke dimag me Sare question kerke patterns banunga uske bad level 2 ke sare question pe bahut sara time invest kerunga

SCRIPTSAG
Автор

Sir thanku so much umeed agyi zindagi m ab apse connected rhuga

anjneykumarsingh
Автор

Sir.. pehle question karne ka man nhi hota tha.. but app ki videos dekhne k baad khud se question krne ka man hota h.maine paid course liya h but vo aapke ki tarah nhi padhate .. maine video app ki dekhta aur question unse puchta hu..

prakharagarwal
Автор

sir aap boht achha padhate ho bss ye meme pareshan krte hai beech beech mai
no offense please

hardworknotimewaste
Автор

null pointer exception deta hai yeh code jab pair lp=isbst(root.left) pr

_ruchirjain
Автор

Sir, Time Complexity O(n) hogi ya ye galat hai?

shubhamsood
Автор

Sir ek doubt tha... Ye last ke 3 questions jo Pair strategy pe based h .. Inke Iterative implementations bhi puche jaa skte h?

Phoenix-xigy
Автор

bhaiyya aap node.data <= and >= use kar rhe ho lekin BST mein to sare nodes unique hone ki jarurat hai na sir ?

kaushikrishi