二叉树的最近公共祖先

class TreeNode:
    def __init__(____):
        self.val = val
        self.left = left
        self.right = right

def solve():
    def lowestCommonAncestor(____):
        if not root or root == p or root == q:
            return root
        left = lowestCommonAncestor(____)
        right = lowestCommonAncestor(____)
        if left and right:
            return root
        return left if left else right
    root = TreeNode(____, TreeNode(____, TreeNode(____), TreeNode(____, TreeNode(____), TreeNode(____))), TreeNode(____, TreeNode(____), TreeNode(____)))
    p = root.left
    q = root.right
    result = lowestCommonAncestor(____)
    print(____)