Lowest Common Ancestor Binary Tree

Given two nodes find lowest common ancestor of these 2 nodes in the binary tree

[okut]

the way this was explained in 11 min. I don't think i can find more valuable solutions for this in such a short time anywhere else. Amazing!

[solflare]

came here after trying to read and failing to understand the leetcode editorial on this question. this was a fantastic explanation, thank you.

[Aksionzapion]

The space complexity of both the algorithms is O(height), because the recursive algorithm will have function calls on the stack.

[xuwang]

I love this guy's multiple walking-through examples on white board!

[kevinbaijnath]

Wow, great explanation about the algorithm! I appreciated the fact that you gave multiple examples that tested different things!

[jlecampana]

Best Video on LCA available on YouTube, Thanks Tushar!

[sharansingh]

After i get tired of the logics and code explained by everyone, i do watch your video to understand it in layman and practical way.

[gurupavan]

Too good explanation. short and sweet. I can say this particular solution is way better explained than Back ToBack SWE. Thanks and appreciate your effort...

[dianel.]

Thank you, sir! I was confused about this recursive code, but now I understand how it works perfectly!

[dnl_blkv]

Another great explanation with a beautiful solution!

[robinsoni]

The other solution also takes the implicit stack during recursion, so yes it does require the extra space.

[cosmicgirl]

Thank you for covering multiple cases. Other videos didn’t explain as thoroughly as you and didn’t go through many test cases

[foreverursabhi]

Optimization note, if the left subtree search yielded the LCA, there's no need to search the right subtree. This can only be avoided by keeping track of how many of the target nodes have been found; it's not sufficient to check if the left subtree search returned a node that is not one of the target nodes, because one of the target nodes may as well be the LCA. For example, 6, and 2.

[abdallaelmedani]

This is a very useful, well explained, and simple algorithm. Thank you, Tushar.

[leonlew]

This was a great visual walkthrough. Clear and concise.

[mtjokro]

Thank you! Finally a video that helped me understand the recursive details of the various cases of binary tree

[cachegrk]

You are videos are just awesome! Great job! Can't imagine prep without your videos!

[decisionguider]

Great job Tushar! Absolutely awesome walkthrough..

[generalroboskel]

Excellent video/explanation. Your videos make algorithms so much easier.

[learnsharegrow]

Nicely explained. This is a popular problem statement in Amazon interviews.