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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 671. Second Minimum Node In a Binary Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact