Second Minimum Node BST Problem

Second Minimum Node BST Problem — ExecCode Easy DSA Practice

Solve the Second Minimum Node BST problem on ExecCode. Free online easy DSA practice in Tree. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Second Minimum Node BST. Your task is to compute the required answer and return second minimum value or -1. A hierarchy is stored as a tree, and each parent-child link affects the final answer. In Second Minimum Node BST, you must respect the tree structure instead of treating values as a flat list. JSON level-order array root.

Examples

Input {"root": [2, 2, 5, null, null, 5, 7]}; Output 5. Input {"root": [2, 2, 2]}; Output -1. Input {"root": [1]}; Output -1

Constraints

Standard BST property

Practice Second Minimum Node BST free on ExecCode. Browse DSA problems, topic map, and placement guides.