Thank you so much and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
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 😄
Thankyou beta for being our constant supporter. I am glad you liked it. I also hope that you are watching till the end and trying to understand the what, how, and especially why of the problem. If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
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"
Glad to know that you liked the content and thank you for appreciating. The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos. So, keep motivating, keep learning and keep loving Pepcoding😊
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.
Beta, aise nh bolte. Teachers saare he bdiya hote h, kami hmare andar hoti h. Yha aap interest show krte ho aur mjhe pyaar dete ho, issiliye main motivate ho k aacha content deliver kr pata hu aap logo ko. Keep learning, keep motivating and keep loving Pepcoding😊
Thanks for liking and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
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
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a review about us here - g.page/Pepcoding/review?rc
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..
Are Bhai koi nhi sir ke hi student hai jo pda rhe hai jo sir ne btaya whi bta rhe honge usme koi dikket nhi hai sir ki addat ho gyi hai apko wo sir se alag nhi btayenge
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, we request a review g.page/Pepcoding/review?rc You can subscribe to our channel here th-cam.com/users/Pepcodingabout?view_as=subscriber
for the wrong test case when the ln and the rn both holds bst property and 50 itself hold the bst property then the entire tree must be a bst, isn't the largest bst subtree the root node itself? if it is, the code had to print 50, it printed 75 why? if my insight is wrong plz correct me,it would be a great help to me. Thank you
the answer is not 50 because 25 is bst as a tree and as a node similarly 75 too but when you will compare it with 50 they both satisfy the condition but for 50 to be a bst it must be greater than the max of all nodes in left subtree but in this case 51 comes under the left child of 50 which is greater than 50 so 50 will not be considered as bst node and hence the answert 25 and 75 both are correct but not 50.....Hope its clear
If you like our efforts, we request a review g.page/Pepcoding/review?rc You can subscribe to our channel here th-cam.com/users/Pepcodingabout?view_as=subscriber For clearing your doubts, you can join our community on telegram t.me/pepcoding
Bhot he bdiya beta, aise he lge rho aur har question ko phle khud se krne ka he try kiya kro but jab ek moment pr aa k lge ki ab nahi chl rh dimaag to tab refer kr lo solution.
No one gets this much deeper into question unless he is Sumeet Sir.🔥🔥
Thank you so much and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
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 😄
Greeks?! 😂😂
tu chutiya of chutiya ko dhek howla madarchod
Sir ji, you are great! Your patience & dedication is appreciable. There's a lot to learn from you. Thanks!
Thankyou beta for being our constant supporter.
I am glad you liked it. I also hope that you are watching till the end and trying to understand the what, how, and especially why of the problem. If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
I just get amazed every time i see Sumeet sir explaining things, hatsoff to you sir.
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"
Glad to know that you liked the content and thank you for appreciating.
The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos.
So, keep motivating, keep learning and keep loving Pepcoding😊
Thank you Sir
Was able to solve all Binary tree questions on Leetcode (easy medium hard) after understanding the game.
Hope it was helpful.
For better experience and curated content sign up on nados.io
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.
gajab explanation sir!! aap bohot enthusiastic hain.. mere college ke teachers ka combined enthusiasm toh negative me jata hoga😂
Beta, aise nh bolte. Teachers saare he bdiya hote h, kami hmare andar hoti h. Yha aap interest show krte ho aur mjhe pyaar dete ho, issiliye main motivate ho k aacha content deliver kr pata hu aap logo ko.
Keep learning, keep motivating and keep loving Pepcoding😊
Never thought binary trees would be that much easy , thank you sir, waiting for the next topic😀
Keep watching. Please subscribe the channel and press the bell notification. Also, share the channel in your college groups.
what an explanation ! Awesome Sir ji🔥
Thanks for liking and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Sir thanku so much umeed agyi zindagi m ab apse connected rhuga
aapko roadies salute diya jata hai. just kidding. :-P
Sir nhi smjhe
arey aise he mze kar rhe hain yar. padhte rahie. hum bnate rahenge.
Best explanation 🫡🫡
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
what the explanation sir ji....your videos helps me a lot to get dedication towards questions.
thank you
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a review about us here - g.page/Pepcoding/review?rc
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..
Are Bhai koi nhi sir ke hi student hai jo pda rhe hai jo sir ne btaya whi bta rhe honge usme koi dikket nhi hai sir ki addat ho gyi hai apko wo sir se alag nhi btayenge
Shouldn't the correct answer for failing test be 50@11 as complete tree is BST ?
Complete tree is not BST. The maximum on left subtree is 51 which is greater than 50
Sir ek doubt tha... Ye last ke 3 questions jo Pair strategy pe based h .. Inke Iterative implementations bhi puche jaa skte h?
Hanji
nice content and easy explanation
Glad you liked it
14:27 sir jab aapne bola na ki ye baat yaha smjh ni ayegi , ushi time sab smjh aaya
Thanks!
null pointer exception deta hai yeh code jab pair lp=isbst(root.left) pr
For better insight, visit nados.pepcoding.com, post your doubts, community will help you out there.
bhaiyya aap node.data = use kar rhe ho lekin BST mein to sare nodes unique hone ki jarurat hai na sir ?
hanji. dhyaan nahi rha. hta dijie =
Sir, Time Complexity O(n) hogi ya ye galat hai?
Great explaination 🙏🏿
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
But sir in last test case if 25 and 75 both are BST then whole tree should be BST...so Answer should be 50@11...not 75@5 or 25@5
Nahi
50 is root node
If you check left bst contain 51
So 50 is not greater than 51 that mean from 50 is not bt node
That's why there are 2 BST
Wahhh sir kamalkar diya
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
th-cam.com/users/Pepcodingabout?view_as=subscriber
for the wrong test case when the ln and the rn both holds bst property and 50 itself hold the bst property then the entire tree must be a bst, isn't the largest bst subtree the root node itself?
if it is, the code had to print 50, it printed 75 why?
if my insight is wrong plz correct me,it would be a great help to me.
Thank you
the answer is not 50 because 25 is bst as a tree and as a node similarly 75 too but when you will compare it with 50 they both satisfy the condition but for 50 to be a bst it must be greater than the max of all nodes in left subtree but in this case 51 comes under the left child of 50 which is greater than 50 so 50 will not be considered as bst node and hence the answert 25 and 75 both are correct but not 50.....Hope its clear
@@AmanKumar-jt9zb yes sir it's clear,thank you for the clarification,i missed that 51 that you have pointed out. Thank you very much
@@samiulkhan3744 bhai i m also a student yrr
Thank you very much sir
sir aap boht achha padhate ho bss ye meme pareshan krte hai beech beech mai
no offense please
Bhai saab aao samjhate bhot mast ho..
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
th-cam.com/users/Pepcodingabout?view_as=subscriber
For clearing your doubts, you can join our community on telegram
t.me/pepcoding
Mja aa gya❣️
Keep learning, Keep growing and keep loving Pepcoding!😊
Aapreteem (behtreen)
Glad you liked it!
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
Bhaari sawal h
padhte rahie.
Hogya sirji
super sir.....
Thank you so much. If you like the content, please share and subscribe
That annoying sound of current is not allowing to focus
there are some cases that you have not cover
khud solve kiya yeh
Bhot he bdiya beta, aise he lge rho aur har question ko phle khud se krne ka he try kiya kro but jab ek moment pr aa k lge ki ab nahi chl rh dimaag to tab refer kr lo solution.
@@Pepcoding haan sir