Lowest Common ancestor of binary tree

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. For a better experience and more exercises, VISIT: www.pepcoding....
Have a look at our result: www.pepcoding....
Follow us on our TH-cam page: / pepcoding
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Follow us on Pinterest: / _created
Follow us on Twitter: home
.
.
.
Happy Programming !!! Pep it up 😍🤩
.
.
.
#pepcoding #code #coder #codinglife #programming #coding #java #freeresources #datastrucutres #pepcode #competitive #competitiveprogramming #softwareengineer #engineering #engineer

[@pallavibansode6588]

Great job👍....tree was toughest data structure till the date ....but after watching this series every question is looking so easy and understandable....thank you so much for such great amazing series 😀

[@ytgamingraju7304]

Sir g bahut hi achha explain kiya hai...this problem looked like nothing after watching your explanation.

[@sushilkumarrai8956]

Sir pepcoding ki sari videos bahut achi hoti hai. Keep going

[@rishabhgoyal8110]

What a series! Thanks!

[@shang_chi4651]

Kya mast samjhaya sir😁🙏thanks a ton

[@sidharthsinghmarwah]

really good video

[@AshokKumar-ot3dz]

Great

[@AshokKumar-ot3dz]

Sir, LCA of generic tree ki efficient approaches kara do... Sumit sir ne Level 1 mein node to root path wala method kara rakha hai.

[@nirmitshah5325]

I think this program will also work for 1644. Lowest Common Ancestor of a Binary Tree II right?

[@anuragnegi6423]

Sir please make a video on "binary lifting"

[@dheerajchhatani7610]

gr8

[@azeemali6865]

ok x 100

[@walkWithDinkar]

ok

[@Pepcoding]

For better experience, visit nados.io, where you will get well curated content and career opportunities.

[@divyanshuchaudhari3257]

This code is giving incorrect answers.

[@chiragpagaria4353]

yes why it is

[@derilraju2106]

class Solution:
def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
if not root:
return None
if root.val == p.val or root.val==q.val:
return root
left = self.lowestCommonAncestor(root.left,p,q)
right = self.lowestCommonAncestor(root.right,p,q)
if not left:
return right
if not right:
return left
return root