111. Minimum Depth of Binary Tree
发布时间:2020-12-14 04:38:03 所属栏目:大数据 来源:网络整理
导读: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,nul
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 / 15 7 return its minimum?depth = 2. class Solution { public int minDepth(TreeNode root) { if(root == null) return 0; if(root.left == null) return 1 + minDepth(root.right); if(root.right == null) return 1 + minDepth(root.left); return 1+Math.min(minDepth(root.left),minDepth(root.right)); } } 无法像maxdepth那里一步到位,因为要判断是不是空的。 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |