SHARE
    TWEET
    miglss

    42.YA

    Apr 12th, 2025
    442
    0
    Never
    Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
    Python 0.53 KB | None | 0 0
    1. class Solution:
    2. def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
    3. def dfs(root):
    4. if root in (None, p, q):
    5. return root
    7. left = dfs(root.left)
    8. right = dfs(root.right)
    10. if left and right:
    11. return root
    12. elif left:
    13. return left
    14. elif right:
    15. return right
    16. else:
    17. return None
    19. return dfs(root)
    Advertisement
    Add Comment
    Please, Sign In to add comment
    Public Pastes
    We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
    Not a member of Pastebin yet?
    Sign Up, it unlocks many cool features!

    AltStyle によって変換されたページ (->オリジナル) /