Lowest Common Ancestor of a binary tree | Leetcode

This video explains a very frequently asked programming interview problem which is to find the lowest common ancestor in the given binary tree.I have first explained the problem statement followed by concepts of lowest common ancestor using examples and then finally showed 2 different ways to solve the problem. I have shown the first solution by finding the last common node in the root to node path. The second solution is based on simple recursion.
CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
======================================PLEASE DONATE=============================
🧡 SUPPORT OUR WORK: / techdose
💚 UPI-ID: surya.kahar@ybl
💞JOIN Membership: / @techdose4u
==============================================================================
INSTAGRAM : / surya.pratap.k
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithT...
TELEGRAM Group LINK: t.me/joinchat/...
=======================================================================
USEFUL LINKS:
🟠Must do TIPS to ACE Virtual Interview: • 🔴Must do Tips to ACE y...
🟢Best strategy to excel your coding interview: • 🔴Best strategy to exce...
🟡Get your dream job in 1 month: • 🔴Get your dream job in...
🔵How to crack dream job in just 2 months: • How to crack dream job...
🟣7 Days DSA plan: techdose.co.in...
RELATED LINKS:
Vertical Order Traversal of Binary Tree: • Vertical order travers...
Unique BSTs: • Unique Binary Search T...
Count Complete Tree Nodes: • Count Complete Tree No...
CODE LINK: gist.github.co...

[@jlecampana]

You're an excellent teacher, I've learned so much from your videos, you explain recursion beautifully, Thank you!

[@embarrassed_dodo]

Awesome explanation, I had trouble understanding this earlier but now i get it

[@techdose4u]

Great!

[@amratef3245]

I don't comment very often on videos, but yours really helped me. Thank you so much

[@techdose4u]

Welcome :)

[@sirichandanayadav5249]

Happy teacher's day Sir...

[@praveengautam4689]

you explaied node tree recursion like a class 8th maths problem. Bro you're a genius.

[@DaudZaidi]

Nice one. Please do Leetcode 621 - Task Scheduler.

[@techdose4u]

Sure 👍🏼

[@jlecampana]

@TECH DOSE, Yes! Please do 621! Thank you!

[@charkhude]

Thanks

[@techdose4u]

Welcome :)

[@ritikmishra5210]

Man, you're awesome as always!

[@techdose4u]

Thanks 😊

[@anupam6045]

Best expalnation ever

[@albindavis3538]

great explanation theyw ay you explain the question by all possibe senario is superb

[@chrisliewjy]

Great stuff! 👍🏻

[@techdose4u]

Thanks ☺️

[@nurshuvo3854]

Great explanation.

[@techdose4u]

Thanks :)

[@areebashaikh22]

Thank you!

[@mangoman2023]

Very nice explanation. Thank you

[@chetantailor3620]

Nicely explained !!

[@techdose4u]

Thanks

[@harpercfc_]

THIS IS AWESOME.

[@annawilson3824]

TECH DOSE, do you plan to add playlists according to the Leetcode's difficulty level? That would increase views for you and help the audience to watch the whole list of problems that they target. Thanks.

[@techdose4u]

Yes I will 👍🏼

[@annawilson3824]

@@techdose4u thanks, looking forward to it!

[@techdose4u]

👌🏼

[@ui.ashish]

amazing content

[@techdose4u]

Thanks 😊

[@sharonwang592]

Very smart！ Thanks

[@mrinalmadhav8119]

Very much excited

[@techdose4u]

😀

[@devbhattacharya153]

Thanks a lot sir :)

[@nitinsaxena1857]

Excellent.

[@santoshrathod9868]

Thanks brother

[@preetambal7443]

Awesome!!

[@techdose4u]

Thanks

[@JangBahadur3028]

Wait is over. 😊

[@techdose4u]

😀

[@sharetosriram123sdsd]

Your final commentary is a lot confusing and doesn’t explain why you return left or right when the other is null. It is because when right is null you found both modes on left so the left node down is LCA and vice-versa

[@techdose4u]

Take some examples and it will be clear for sure

[@shrutibansal5261]

👏👏👏

[@maruthkamath9304]

~12.30 is wrong.LCA could have been 5 also . So the conclusion is wrong. I guess needs an edit.

[@sunny-14689]

Can you also discuss on side how to solve if links to parent is present (i.e each node contains link to parent) ?

[@techdose4u]

Ok

[@biswajitmahato4413]

What is the editor name?

[@andrepinto7895]

This makes unnecessary work. Imagine that both nodes are on the left, your code still explores the entire right subtree, when it could already stop the search there. You can keep state locally in the class or use an helper method with an additional settable field to avoid this. On the other hand, the fact that you don't continue the search down the subtrees when root matches one of the nodes, reduces the search space, so depending on the case, it might end up being better or worse.

[@calvio2835]

such an awful explanation