Minimum Depth of Binary Tree

LeetCode 111

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note: A leaf is a node with no children.

Example

return its minimum depth = 2.