Great explanation as always. Even though I am able to solve some of this problems by myself, and even though I don't know Python, I still find something to learn in each of this videos. Thank you!
What if a subtree has two leaves which are unsymmetrically deepest? eg they are the deepest and the 2nd deepest leaves, and their depth differs by 1 and no other leaf is nearly as deep as these two?
Great explanation as always. Even though I am able to solve some of this problems by myself, and even though I don't know Python, I still find something to learn in each of this videos. Thank you!
It's the new year so I liked and subscribed for good!
Very detail analysis. Thank you
Thank you!
What if a subtree has two leaves which are unsymmetrically deepest? eg they are the deepest and the 2nd deepest leaves, and their depth differs by 1 and no other leaf is nearly as deep as these two?
Got it, the question wants only the exclusively deepest, and all of such equally deepest
Thanks ser
very helpful! thank you so much! in order to comment your vedio,i register youtube hhhhh!
Have you bought the leetcode premium?
Yes obviously. It’s an absolute must
@@crackfaang hhhhh so cute!