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.
Definition of a tree:
Implement function minDepth that returns the minimum depth of the tree.
Function minDepth returns 2 because the shortest path from the root 5 to the nearest leaf 10 contains 2 nodes.