首页 > 编程语言 > 详细

Java for LeetCode 111 Minimum Depth of Binary Tree

时间:2015-05-23 21:16:21      阅读:277      评论:0      收藏:0      [点我收藏+]

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.

解题思路:注意minimum depth最后遍历的那个点,left right都必须为null,JAVA实现如下:

    public int minDepth(TreeNode root) {
        if(root==null)
        	return 0;
        else if(root.left==null)
        	return minDepth(root.right)+1;
        else if(root.right==null)
        	return minDepth(root.left)+1;
        else return Math.min(minDepth(root.left),minDepth(root.right))+1;
    }

 

Java for LeetCode 111 Minimum Depth of Binary Tree

原文:http://www.cnblogs.com/tonyluis/p/4524811.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!