154.Minimum Depth of Binary Tree

发布时间：2020-12-14 03:46:26 所属栏目：大数据来源：网络整理

导读：题目： 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. 最小深度是沿从根节点到最近的叶节点的最短路

题目：

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.

最小深度是沿从根节点到最近的叶节点的最短路径上的节点数。

Note:?A leaf is a node with no children.

注意：叶子是没有子节点的节点。

Example:

Given binary tree?[3,9,20,null,15,7],

    3
   /   9  20
    /     15   7

return its minimum?depth = 2.

解答：

 1 /**
 2  * Definition for a binary tree node.
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 class Solution {
11     public int minDepth(TreeNode root) {
12         if(root==null) return 0;
13         int left=minDepth(root.left);
14         int right=minDepth(root.right);
15         return (left==0 || right==0) ? left+right+1:Math.min(left,right)+1;
16     }
17 }

详解：

?DFS 栈递归

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!