LOWEST COMMON ANCESTOR OF DEEPEST LEAVES | LEETCODE 1123 | PYTHON DFS SOLUTION

[@baetz2]

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!

[@jamesnguyen3459]

Very detail analysis. Thank you

[@hangchen]

It's the new year so I liked and subscribed for good!

[@sarayarmohammadi3376]

Thank you!

[@AP-eh6gr]

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?

[@AP-eh6gr]

Got it, the question wants only the exclusively deepest, and all of such equally deepest

[@李燕行]

very helpful! thank you so much! in order to comment your vedio,i register youtube hhhhh!

[@eddiej204]

Thanks ser

[@abhicasm9237]

Have you bought the leetcode premium?

[@crackfaang]

Yes obviously. It’s an absolute must

[@李燕行]

@@crackfaang hhhhh so cute!