Total Accepted: 11612 Total Submissions: 39946
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 for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int minDepth(TreeNode root) {
if (root == null) return 0;
if (root.left == null && root.right == null) return 1;
int depthL = Integer.MAX_VALUE;
int depthR = Integer.MAX_VALUE;
if (root.left != null) depthL = minDepth(root.left);
if (root.right != null) depthR = minDepth(root.right);
return 1 + (depthL < depthR ? depthL : depthR);
}
}