题目描述
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.
代码:
public class Solution {
public int maxDepth(TreeNode root) {
if(root == null)
return 0;
int lDepth = maxDepth(root.left);
int rDepth = maxDepth(root.right);
return 1 + (lDepth>rDepth?lDepth:rDepth);
}
}