Problem 104: Minimum Depth of Binary Tree Difficulty: Easy Problem 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. Example Self-explanatory