Untitled

def get_parents(root: Node, num: int):
    if num < root.val:
        return get_parents(root.left, num) + [root.val]
    elif num > root.val:
        return get_parents(root.right, num) + [root.val]
    else:
        return [root.val]

def solve(root: Node, p: int, q: int) -> int:
    pars_p = get_parents(root, p)
    pars_q = get_parents(root, q)
    same_pars = [i for i in pars_p if i in pars_q]
    return same_pars[0]