题目描述
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.
求二叉树根节点到叶子节点的最短路径。解题思路
递归求解:
- root==null,返回0;
- root.left == null && root.right == null,返回1;
- 2不成立的条件下,root.left == null,返回minDepth(root.right) + 1;
- 2不成立的条件下,root.right == null,返回minDepth(root.left) + 1;
- root.left != null && root.right != null返回Math.min(minDepth(root.left), minDepth(root.right)) + 1。
代码
public static int minDepth(TreeNode root) {
if (root == null)
return 0;
if (root.left == null && root.right == null) {
return 1;
} else {
if (root.left == null) {
return minDepth(root.right) + 1;
}
if (root.right == null) {
return minDepth(root.left) + 1;
} else {
return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
}
}
}