Delete Node in a BST | leetcode 450 | Hindi

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

no one explain like you big bro thanku because of you i solve this problem

rajgupta-ey
Автор

Thank you so much. I watched so many videos. Yours is the only one that i understood. Thank you very much. God Bless

pragatidharmale
Автор

Just by removing the comparison line Math.max(root.val, max) the code becomes faster than the 100% Java submissions! Great explanation by the way!

SR-wevl
Автор

Awesome explanation made MEDIUM level problem looks simple 👍

rechinraj
Автор

waah.. nice question and nicely explained.. you are too good! Thanks!

aamirjamal
Автор

very good explanation, keep up the good work.

Vipul-on-Guitar
Автор

Love u bro.. awesome way of explanation ❤️❤️

karan
Автор

awesome explanation plz make more videos on Leetcode question

sharuk
Автор

bhaai jo root node delete krni he uske right subtree me min. find karte he or left subtree me max find krte he position change krne ke liye...Lekin aapne 14:30 pe jo example diya usme node delete krne ke liye right side me max kyu find right side toh minimum find krenge naa...??pleaseee

ankushgg
Автор

sir agar Math.max nahi use kar na hh tu kaisy karenge? interview mein Math.max use kar sakte hain

kamlendratripathi
Автор

sir wo findmax function hh while( node!=null){
max=max(node.data, max);
node=node.right;
}
y sir node=node.right q kiya
max tu leftsubtree se lena hh na
node=node.left nahin kar sakte kya

kamlendratripathi
join shbcf.ru