Leetcode 671. Second Minimum Node In a Binary Tree

Given a special binary tree where each internal node's value equals the minimum of its two children and every node has either 0 or 2 children, find the second smallest distinct value among all node values (return -1 if none). Use a traversal that leverages the min-property to ignore subtrees that cannot contain a larger candidate.