Leetcode 2003. Smallest Missing Genetic Value in Each Subtree

Given a rooted tree where each node has a distinct genetic value (1..1e5), compute for every node the smallest positive integer (mex) that is missing from that node's subtree. The challenge is to produce these subtree mex values efficiently for up to 1e5 nodes/values.