Leetcode 1676. Lowest Common Ancestor of a Binary Tree IV

Given a binary tree and a list of target nodes, find the lowest common ancestor — the deepest node whose subtree contains all the targets. The core challenge is to compute this in one traversal by aggregating which targets appear in each subtree (generalizing the standard LCA algorithm to k nodes).