412. Smallest Node Value in Tree

Given the root of a binary tree, find the smallest value among all the nodes in the tree. Assume the tree contains at least one node.

Example:
Input: root = [1, 0, 3, 2] (representing a tree structure)
Output: 0

Run this challenge interactively in Python or JavaScript when the app loads.