Smallest SubTree with deepest nodes | leetcode 865 | Hindi 

FINALLY a soul which i was able to understand after so much scrolling...... Can see by the way of explanation that he is not gifted instead a hard worker who understands which part is harder to grasp and he kept explaining to make clear GOOD WORK, subscribed!

I guess we can optimize this solution because we are calling the height function at every node so time complexity O(h*h)

It seems so easy when you explain! Thank you sir!

It is an O(n2) solution, one must try to find an O(n) solution.

superb explanation sir 🔥🔥🔥🔥🔥

superb explaination sir👌👌👌

great explanation for beginners like me...thanks dude.

Amazing solution for the problem...and great explaination..

Wow sir! Excellent Explanation

Your explanation is amazing!!

Thanks Sir, Got the concept

Great I totally like your way !!! 😉 Now you have One more subscriber

bro amazing explanation keep going....

Amazing explanation.

Please make more videos please

Approach: 1. Get the first and last node the deepest level. 2. Get the LCA of these 2 nodes.

Thanks a lot

What is Point class

kuch bi😒😒

Nice codebix 🎉