Given a binary tree, find its minimum depth.Input Format
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
NOTE: The path has to end on a leaf node.
The first argument is a TreeNode, pointing to the root of the binary tree.Output Format
Return an integer equal to the minimum depth of the tree.Example Input
Minimum Depth is 2, which is from 1 -> 2.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.