在Tree[Binary]中找到最低公共祖先，但在python中有多个节点？

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

def findLowestCommonAncestor(root, p, q):
    if root is None or root == p or root == q:
        return root
    
    left = findLowestCommonAncestor(root.left, p, q)
    right = findLowestCommonAncestor(root.right, p, q)
    
    if left and right:
        return root
    elif left:
        return left
    else:
        return right

# 创建一个二叉树
#       3
#      / \
#     5   1
#    / \ / \
#   6  2 0  8
#     / \
#    7   4
root = TreeNode(3)
root.left = TreeNode(5)
root.right = TreeNode(1)
root.left.left = TreeNode(6)
root.left.right = TreeNode(2)
root.right.left = TreeNode(0)
root.right.right = TreeNode(8)
root.left.right.left = TreeNode(7)
root.left.right.right = TreeNode(4)

p = root.left  # 节点5
q = root.left.right.right  # 节点4

lca = findLowestCommonAncestor(root, p, q)
print("最低公共祖先节点的值为:", lca.val)