Lowest Common Ancestor of a Binary Tree II

Given a binary tree and two target nodes p and q, return their lowest common ancestor if and only if both targets exist in the tree, otherwise return null. The main challenge is to compute the LCA while simultaneously verifying the presence of p and q during a single traversal (e.g., post-order DFS).